An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.