Last update: Sun Oct 15 02:37:12 MDT 2017
@Article{Meduna:2012:IHL, author = "Alexander Meduna and Luk{\'a}{\v{s}} Vr{\'a}bel and Petr Zemek", title = "An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets", journal = j-LECT-NOTES-COMP-SCI, volume = "7386", pages = "236--243", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-31623-4_18", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:21:27 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012f.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-31623-4_18/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-31623-4", book-URL = "http://www.springerlink.com/content/978-3-642-31623-4", fjournal = "Lecture Notes in Computer Science", }