On the relationship between the McNaughton families of languages and the chomsky hierarchy

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

Volumn 2295 LNCS, Issue , 2002, Pages 340-348

  Beaudry, M ^a   Holzer, M ^b   Niemann, G ^c   Otto, F ^c  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITY OF KASSEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

CHOMSKY HIERARCHY; CHURCH-ROSSER LANGUAGES; CLOSURE PROPERTY; COMPLEXITY ISSUES; MEMBERSHIP PROBLEM; STRING REWRITING;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS;

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

References (20)

1. M. Beaudry, M. Holzer, G. Niemann, and F. Otto. McNaughton languages. Mathematische Schriften Kassel 26/00, Universität Kassel, November 2000.A revised version will appear in Theoret. Comput. Sci.
2. L. Boasson and G. Sénizergues. NTS languages are deterministic and congruential. J. Comput. System Sci., 31:332-342, 1985.
3. R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoret. Comput. Sci., 19:231-251, 1982.
4. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.
5. G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. Inform. and Comput., 141:1-36, 1998.
6. S. Buss. The Boolean formula value problem is in ALOGTIME. In Proc. of 19th STOC, pp. 123-131. ACM Press, 1987.
7. S.A. Cook and P. McKenzie. Problems complete for deterministic logarithmic space. J. Algorithms, 8:385-394, 1987.
8. C. Herzog. Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoret. Comput. Sci., 181:141-157, 1997.
9. M. Holzer and K.-J. Lange. On the complexities of linear LL(1) and LR(1) grammars. In Z. Esik, editor, Proceedings 9th FCT, Lect. Notes Comput. Sci. 710, pp. 299-308. Springer-Verlag, Berlin, 1993.
10. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979.
11. D.S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pp. 67-161. The MIT Press/Elsevier, Cambridge, MA/Amsterdam, 1990.
12. N.D. Jones and W.T. Laaser. Complete problems for deterministic polynomial time. Theoret. Comput. Sci., 3:105-117, 1977.
13. M. Lohrey. Private communication, November 2000.
14. K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic stringrewriting systems. Theoret. Comput. Sci., 113:119-165, 1993.
15. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. J. ACM, 35:324-344, 1988.
16. P. Narendran. Church-Rosser and related Thue systems. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York, 1984.
17. G. Niemann. Regular Languages and Church-Rosser congruential languages. In R. Freund and A. Kelemenová, editors, Grammar Systems 2000, Proceedings, pp. 359-370. Silesian University, Opava, 2000.
18. G. Niemann and J.Waldmann. Some regular languages that are Church-Rosser congruential. This volume.
19. G. Niemann and F. Otto. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In M. Nivat, editor, Proceedings FoSSaCS'98, Lect. Notes Comput. Sci. 1378, pp. 243-257. Springer-Verlag, Berlin, 1998.
20. H. Sudborough. On the tape complexity of deterministic context-free languages. J. ACM, 25:405-414, 1978.