On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
On Word Rewriting Systems Having a Rational Derivation
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Rational subsets of polycyclic monoids and valence automata
Information and Computation
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Hi-index | 0.01 |