Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids

Undecidability Results for Monoids with Linear-Time Decidable Word Problems

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation

On the Connections between Rewriting and Formal Language Theory

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications

Undecidable properties of monoids with word problem solvable in linear time. Part II: cross sections and homological and homotopical finiteness conditions

Theoretical Computer Science

The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages

Theoretical Computer Science

Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory

On s-regular preffix-rewriting systems and automatic structures

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Growing Grammars and Length-reducing Automata

Fundamenta Informaticae - Non-Classical Models of Automata and Applications II