A Direct Construction of Finite State Automata for Pushdown Store Languages

DOI10.1007/978-3-642-39310-5_10zbMath1388.68171OpenAlexW2211275699MaRDI QIDQ2843087

Viliam Geffert, Carlo Mereghetti, Andreas Malcher, Katja Meckel, Beatrice Palano

Publication date: 9 August 2013

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39310-5_10

zbMATH Keywords

pushdown automatadescriptional complexitypushdown store languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Deterministic input-driven queue automata: finite turns, decidability, and closure properties

This page was built for publication: A Direct Construction of Finite State Automata for Pushdown Store Languages