Computer Science – Formal Languages and Automata Theory
Scientific paper
2012-02-06
Computer Science
Formal Languages and Automata Theory
Scientific paper
This paper proves a long standing conjecture in formal language theory. It shows that all regular languages are Church-Rosser congruential. The class of Church-Rosser congruential languages was introduced by McNaughton, Narendran, and Otto in 1988. A language L is Church-Rosser congruential, if there exists a finite confluent, and length-reducing semi-Thue system S such that L is a finite union of congruence classes modulo S. It was known that there are deterministic linear context-free languages which are not Church-Rosser congruential, but on the other hand it was strongly believed that all regular language are of this form. Actually, this paper proves a more general result.
Diekert Volker
Kufleitner Manfred
Reinhardt Klaus
Walter Tobias
No associations
LandOfFree
Regular Languages are Church-Rosser Congruential does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Regular Languages are Church-Rosser Congruential, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular Languages are Church-Rosser Congruential will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-119562