McNaughton families of languages

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1581-1628

  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

Chomsky hierarchy; Church Rosser language; Closure property; McNaughton family; Membership problem; String rewriting

Indexed keywords

TURING MACHINES;

CHOMSKY HIERARCHY; CLOSURE PROPERTY; MCNAUGHTON FAMILY; MEMBERSHIP PROBLEM; STRING REWRITING;

CONTEXT FREE LANGUAGES;

EID: 85009188226     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00070-1     Document Type: Article

References (31)

1. [1] Berstel, J., Transductions and Context-free Languages, Teubner Studienbücher, 1979, Teubner, Stuttgart.
2. [2] Bédard, F., Lemieux, F., McKenzie, P., Extensions to Barrington's M-program model. Theoret. Comput. Sci. 107 (1993), 31–61.
3. [3] Birget, J.C., Infinite string rewrite systems and complexity. J. Symbolic Comput. 25 (1998), 759–793.
4. [4] Boasson, L., Sénizergues, G., NTS languages are deterministic and congruential. J. Comput. System Sci. 31 (1985), 332–342.
5. [5] Book, R.V., Otto, F., String-Rewriting Systems, 1993, Springer, New York.
6. [6] Book, R.V., Jantzen, M., Wrathall, C., Monadic Thue systems. Theoret. Comput. Sci. 19 (1982), 231–251.
7. [7] G. Buntrock, Wachsende kontext-sensitive Sprachen, Habilitationsschrift, Fakultät für Mathematik und Informatik, Universität Würzburg, July 1996.
8. [8] Buntrock, G., Otto, F., Growing context-sensitive languages and Church–Rosser languages. Inform. and Comput. 141 (1998), 1–36.
9. [9] Buss, S., The Boolean formula value problem is in ALOGTIME. Proc. 19th STOC, 1987, ACM Press, New York, 123–131.
10. [10] Cook, S., McKenzie, P., Problems complete for deterministic logarithmic space. J. Algorithms 8 (1987), 385–394.
11. [11] Dahlhaus, E., Warmuth, M., Membership for growing context-sensitive grammars is polynomial. J. Comput. System Sci. 33 (1986), 456–472.
12. [12] Greibach, S., The hardest context-free language. SIAM J. Comput. 2 (1973), 304–310.
13. [13] Griffith, Th., Some remarks on derivations in general rewriting systems. Inform. and Control 12 (1968), 27–54.
14. [14] Grzegorczyk, A., Some classes of recursive functions. Rozprawy Matematycne 4 (1953), 1–45.
15. [15] Harrison, M., Introduction to Formal Language Theory, 1979, Addison-Wesley, Reading, MA.
16. [16] Herzog, Ch., Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoret. Comput. Sci. 181 (1997), 141–157.
17. [17] Holzer, M., Lange, K.-J., On the complexities of linear LL(1) and LR(1) grammars. Ésik, Z., (eds.) Proc. Fundamentals of Computation Theory, Lecture Notes in Computer Science, Vol. 710, 1993, Springer, Berlin, 299–308.
18. [18] Hopcroft, J.E., Ullman, J.D., Introduction to Automata Theory, Languages and Computation, 1979, Addison-Wesley, Reading, MA.
19. [19] Johnson, D.S., A catalog of complexity classes. van Leeuwen, J., (eds.) Handbook of Theoretical Computer Science, 1990, The MIT Press/Elsevier, Cambridge/Amsterdam, 67–161.
20. [20] Jones, N.D., Laaser, W.T., Complete problems for deterministic polynomial time. Theoret. Comput. Sci. 3 (1977), 105–117.
21. [21] M. Lohrey, Private communication, November 2000.
22. [22] Madlener, K., Otto, F., Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. J. Symbolic Comput. 1 (1985), 383–418.
23. [23] Madlener, K., Narendran, P., Otto, F., Zhang, L., On weakly confluent monadic string-rewriting systems. Theoret. Comput. Sci. 113 (1993), 119–165.
24. [24] McNaughton, R., Narendran, P., Otto, F., Church–Rosser Thue systems and formal languages. J. Assoc. Comput. Mach. 35 (1988), 324–344.
25. [25] P. Narendran, Church–Rosser and related Thue systems, Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, New York, 1984.
26. [26] G. Niemann, Regular languages and Church–Rosser congruential languages, in: R. Freund, A. Kelemenová (Eds.), Proc. Grammar Systems, Silesian University, Opava, 2000, pp. 359–370.
27. [27] Niemann, G., Otto, F., The Church–Rosser languages are the deterministic variants of the growing context-sensitive languages. Nivat, M., (eds.) Foundations of Software Science and Computation Structures, Proc. FoSSaCS’98, Lecture Notes in Computer Science, Vol. 1378, 1998, Springer, Berlin, 243–257.
28. [28] G. Niemann, F. Otto, The Church–Rosser languages are the deterministic variants of the growing context-sensitive languages, Revised and extended version of [27], submitted for publication.
29. [29] Niemann, G., Waldmann, J., Some regular languages that are Church–Rosser congruential. Kuich, W., Rozenberg, G., Saloman, A., (eds.) Developments in Language Theory, Proceedings DLT 2001, Lecture Notes in Computer Science, Vol. 2295, 2002, Springer, Berlin, 330–339.
30. [30] Sudborough, H., On the tape complexity of deterministic context-free languages. J. Assoc. Comput. Mach. 25 (1978), 405–414.
31. [31] Tourlakis, G.J., Computability, 1984, Reston Publishing Company, Reston, VA.