Regular languages are Church-Rosser congruential

Regular languages are Church-Rosser congruential

© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids and weight reducing string rewriting systems. As a consequence it proves a long standing conjecture in formal language theory: All regular languages are Church-Rosser congruential. The class of Church-...

Full description

Saved in:
Bibliographic Details
Main Authors: Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
Format: Default Article
Published: 2015
Subjects:
Other information and computing sciences not elsewhere classified
Church-Rosser system
Local divisor
Regular language
Semigroup
String rewriting
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/31954
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/31954

Similar Items