Abstract
The complexities of problems related to automata with storages, an abstract automaton model introduced by Engelfriet, are analyzed. In particular, we show a close relationship between the word problem of two-way automata and the emptiness problem of one-way automata. Moreover, we give some hardest languages for classes of languages accepted by some automata with storages.
This work was supported by SFB 342, Teilprojekt A4 of the Deutsche Forschungsgemeinschaft
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Beeri, Two-way nested stack automata are equivalent to two-way stack automata. J.Comp.Syst.Sci. 10 (1975) 317–339.
S. Buss, The Boolean formula value problem is in ALOGTIME. Proc. 19th STOC, 123–131, 1987.
S. Cook, Characterizations of pushdown machines in terms of time bounded computers. J.Assoc.Comp.Mach. 18 (1971) 4–18.
J. Engelfriet, Context-free grammars with storages. Techn. Report 86-11, University of Leiden, Department of Computer Science.
J. Engelfriet and H.J. Hoogeboom, Automata with storage on infinite words. LNCS 372, 289–303.
S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam, 1975.
S. Greibach, The hardest context-free language. SIAM J.Comput. 2 (1973) 304–310.
J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading Mass., 1979.
H. Hunt, On the complexity of finite, pushdown, and stack automata. Math. Systems Theory 10, (1976) 33–52.
O. Ibarra, Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. J.Comp.System Sci. 5 (1971) 88–117.
K.-J. Lange, Complexity theory and formal languages. LNCS 381, 19–36, 1988.
K.-J. Lange and M. Schudy, A further link between formal languages and complexity theory. EATCS Bull. 33 (1987) 67–71.
N. Lynch, LOGSPACE recognition and translation of parenthesis languages. J.Assoc.Comp.Mach. 24 (1977) 583–590.
B. Monien and I.H.Sudborough, The interface between language theory and complexity theory. In R.Book (ed.), Formal Languages — Perspectives and Open Problems, 287–324, Academic Press, 1980.
G. Rozenberg, On a family of acceptors for some classes of developmental languages. Internat.J.Comput.Math. 4 (1974) 218–235.
I.H. Sudborough, On the tape complexity of deterministic context-free languages. J.Assoc.Comp.Mach. 25 (1978) 405–414.
K. Wagner and G. Wechsung, Computational Complexity. Deutscher Verlag der Wissenschaften, Berlin, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dassow, J., Lange, KJ. (1991). Computational complexity and hardest languages of automata with abstract storages. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_64
Download citation
DOI: https://doi.org/10.1007/3-540-54458-5_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54458-6
Online ISBN: 978-3-540-38391-8
eBook Packages: Springer Book Archive