Input-Driven Pushdown Automata with Limited Nondeterminism

DOI10.1007/978-3-319-09698-8_9zbMath1425.68224OpenAlexW61065984MaRDI QIDQ2921977

Alexander Okhotin, Kai Salomaa

Publication date: 14 October 2014

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09698-8_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

On the power of pushing or stationary moves for input-driven pushdown automata ⋮ Extending Wagner's hierarchy to deterministic visibly pushdown automata ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ Earliest query answering for deterministic stepwise hedge automata ⋮ Sweeping input-driven pushdown automata ⋮ State Complexity of the Quotient Operation on Input-Driven Pushdown Automata ⋮ Edit distance neighbourhoods of input-driven pushdown automata ⋮ On the determinization of event-clock input-driven pushdown automata ⋮ Deciding path size of nondeterministic (and input-driven) pushdown automata ⋮ Digging input-driven pushdown automata ⋮ Input-driven pushdown automata on well-nested infinite strings

This page was built for publication: Input-Driven Pushdown Automata with Limited Nondeterminism