Regular Languages Are Church-Rosser Congruential

DOI10.1007/978-3-642-31585-5_19zbMath1367.68166OpenAlexW2274187329MaRDI QIDQ5894973

Tobias Walter, Volker Diekert, Klaus Reinhardt, Manfred Kufleitner

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/31954

zbMATH Keywords

regular languagestring rewritingfinite semigroupfinite monoidChurch-Rosser systemlocal divisor

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Related Items (4)

A survey on the local divisor technique ⋮ The Schützenberger category of a semigroup. ⋮ Toward a theory of input-driven locally parsable languages ⋮ An almost-confluent congruential language which is not Church-Rosser congruential

This page was built for publication: Regular Languages Are Church-Rosser Congruential