ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Model-Checking Infinite Systems Generated by Ground Tree Rewriting
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
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
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
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
Theoretical Computer Science
On Bifix Systems and Generalizations
Language and Automata Theory and Applications
Tree automata with memory, visibility and structural constraints
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
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
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On the Size of Stack and Synchronization Alphabets of Tree Automata
Fundamenta Informaticae
Transition graphs of rewriting systems over unranked trees
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.24 |