Decidability of EDT0L structural equivalence
Theoretical Computer Science
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Regular Sets of Descendants by Some Rewrite Strategies
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Homomorphisms and Concurrent Term Rewriting
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Term rewriting restricted to ground terms
Theoretical Computer Science
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
Information Processing Letters
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
On Bifix Systems and Generalizations
Language and Automata Theory and Applications
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Closure of Tree Automata Languages under Innermost Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Unique Normalization for Shallow TRS
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Approximation-based tree regular model-checking
Nordic Journal of Computing
Tree automata for rewrite strategies
Journal of Symbolic Computation
Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Rigid tree automata and applications
Information and Computation
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Reachability analysis of mobile ambients in fragments of AC term rewriting
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |