Descriptional complexity of unambiguous input-driven pushdown automata
From MaRDI portal
Publication:484313
DOI10.1016/j.tcs.2014.11.015zbMath1318.68111MaRDI QIDQ484313
Kai Salomaa, Alexander Okhotin
Publication date: 6 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.015
nondeterminism; descriptional complexity; unambiguity; input-driven pushdown automata; nested word automata; visibly pushdown automata
68Q45: Formal languages and automata