Alexander Meduna, Lukás Vrábel, Petr Zemek. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. In Martin Kutrib, Nelma Moreira, Rogério Reis, editors, Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Volume 7386 of Lecture Notes in Computer Science, pages 236-243, Springer, 2012. [doi]
@inproceedings{MedunaVZ12,
title = {An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets},
author = {Alexander Meduna and Lukás Vrábel and Petr Zemek},
year = {2012},
doi = {10.1007/978-3-642-31623-4_18},
url = {http://dx.doi.org/10.1007/978-3-642-31623-4_18},
researchr = {https://researchr.org/publication/MedunaVZ12},
cites = {0},
citedby = {0},
pages = {236-243},
booktitle = {Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings},
editor = {Martin Kutrib and Nelma Moreira and Rogério Reis},
volume = {7386},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-31622-7},
}