Some regular languages that are church-rosser congruential

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2295 LNCS, Issue , 2002, Pages 330-339

  Niemann, Gundula ^a   Waldmann, Johannes ^b  

^a UNIVERSITY OF KASSEL   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; CONTEXT FREE LANGUAGES; RELIGIOUS BUILDINGS;

CONTEXT-FREE; LEVEL-1; STRING REWRITING;

RELIGIOUS BUILDINGS; COMPUTATIONAL LINGUISTICS;

EID: 84876897093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46011-x_29     Document Type: Conference Paper

References (7)

1. Ronald V. Book and Friedrich Otto. String-Rewriting Systems. Texts and Monographs in Computer Science. Springer, New-York, 1993.
2. Robert McNaughton, Paliath Narendran, and Friedrich Otto. Church-Rosser Thue systems and formal languages. Journal of the ACM, 35:324-344, 1988.
3. Gundula Niemann. Regular Languages and Church-Rosser Congruential Languages. In Rudolf Freund and Alica Kelemenova, editors, Proceedings of the International Workshop Grammar Systems 2000, pages 359-370. Silesian University at Opava, Faculty of Philosophy and Science, Institute of Computer Science, 2000.
4. Jean-Eric Pin. Syntactic semigroups. In Rozenberg and Salomaa [5], pages 679-746.
5. G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages, volume 1. Springer, 1997.
6. A. Szilard, S.Yu, K. Zhang, and J. Shallit. Characterizing regular languages with polynomial densities. In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science, number 629, pages 494-503, Berlin/New York, 1992. Springer.
7. ShengYu. Regular languages. In Rozenberg and Salomaa [5], pages 41-110.