Regular Languages Are Church-Rosser Congruential

Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter. Regular Languages Are Church-Rosser Congruential. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, editors, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Volume 7392 of Lecture Notes in Computer Science, pages 177-188, Springer, 2012. [doi]

Abstract

Abstract is missing.