Abstract
By generalizing the Church-Rosser languages the McNaughton families of languages are obtained. Here we concentrate on those families that are defined by monadic or special string-rewriting systems. We investigate the relationship of these families to each other and to the lower classes of the Chomsky hierarchy and present some closure and some non-closure properties for them. Moreover, we address some complexity issues for their membership problems.
Most of the work presented here was performed, while M. Holzer was visiting the Département d’I.R.O., Université de Montréal, Montréal, Québec, Canada.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
L. Boasson and G. Sénizergues. NTS languages are deterministic and congruential. J. Comput. System Sci., 31:332–342, 1985.
R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoret. Comput. Sci., 19:231–251, 1982.
R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, NewYork, 1993.
G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. Inform. and Comput., 141:1–36, 1998.
S. Buss. The Boolean formula value problem is in ALOGTIME. In Proc. of 19th STOC, pp. 123–131. ACM Press, 1987.
S.A. Cook and P. McKenzie. Problems complete for deterministic logarithmic space. J. Algorithms, 8:385–394, 1987.
C. Herzog. Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoret. Comput. Sci., 181:141–157, 1997.
M. Holzer and K.-J. Lange. On the complexities of linear LL(1) and LR(1) grammars. In Z. Ésik, editor, Proceedings 9th FCT, Lect. Notes Comput. Sci. 710, pp. 299–308. Springer-Verlag, Berlin, 1993.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979.
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.
N.D. Jones and W.T. Laaser. Complete problems for deterministic polynomial time. Theoret. Comput. Sci., 3:105–117, 1977.
M. Lohrey. Private communication, November 2000.
K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic stringrewriting systems. Theoret. Comput. Sci., 113:119–165, 1993.
R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. J. ACM, 35:324–344, 1988.
P. Narendran. Church-Rosser and related Thue systems. PhD thesis, Rensselaer Polytechnic Institute, Troy, NewYork, 1984.
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.
G. Niemann and J. Waldmann. Some regular languages that are Church-Rosser congruential. This volume.
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.
H. Sudborough. On the tape complexity of deterministic context-free languages. J. ACM, 25:405–414, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaudry, M., Holzer, M., Niemann, G., Otto, F. (2002). On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_30
Download citation
DOI: https://doi.org/10.1007/3-540-46011-X_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43453-5
Online ISBN: 978-3-540-46011-4
eBook Packages: Springer Book Archive