Author:
Geffert Viliam,Malcher Andreas,Meckel Katja,Mereghetti Carlo,Palano Beatrice
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Handbook of Formal Languages, vol. 1, pp. 111–174. Springer (1997)
2. Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410, 3209–3222 (2009)
3. Büchi, J.R.: Regular canonical systems. Arch. Math. Logik Gr. 6, 91–111 (1964)
4. Chomsky, N.: Context-free grammars and pushdown storage. Quarterly Progress Report No. 65, Research Lab. Electonics. MIT, Cambridge, Massachusetts (1962)
5. Evey, J.: The theory and applications of pushdown store machines. Ph.D. Thesis, Harvard University, Cambridge, Massachusetts (1963)