Church-rosser and related thue systems (word problem, rewrite rules, congruence)

Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory

McNaughton families of languages

Theoretical Computer Science

The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Information and Computation

Context-free languages can be accepted with absolutely no space overhead

Information and Computation

Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics

Degrees of non-monotonicity for restarting automata

Theoretical Computer Science

Note: A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems

Theoretical Computer Science

Context-free languages can be accepted with absolutely no space overhead

Information and Computation

The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Information and Computation

Restarting automata and their relations to the Chomsky hierarchy

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

Regular languages are church-rosser congruential

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II