Author:
Holzer Markus,Lange Klaus-Jörn
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer, 1988.
2. S. A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18:4–18, 1971.
3. J. Dassow and K.-J. Lange. Complexity of automata with abstract storages. In Proceedings of the 8th Fundamentals of Computing Theory, number 529 in LNCS, pages 200–209. Springer, 1991.
4. P. Flajolet and J. Steyaert. Complexity of classes of languages and operators. Rap. de Recherche 92, IRIA Laboria, 1974.
5. S. Ginsburg. Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam, 1975.