Input-driven pushdown automata on well-nested infinite strings
From MaRDI portal
Publication:2117102
DOI10.1007/978-3-030-79416-3_21OpenAlexW3175969508MaRDI QIDQ2117102FDOQ2117102
Authors: Alexander Okhotin, Victor Selivanov 
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_21
Cites Work
- Visibly pushdown languages
- Title not available (Why is that?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Title not available (Why is that?)
- On ω-regular sets
- Descriptional complexity of unambiguous input-driven pushdown automata
- Wadge-like reducibilities on arbitrary quasi-Polish spaces
- Adding Nesting Structure to Words
- A hierarchy of deterministic context-free \(\omega\)-languages.
- Topological complexity of context-free \(\omega \)-languages: a survey
- State complexity of operations on input-driven pushdown automata
- Input-Driven Pushdown Automata with Limited Nondeterminism
- The Wadge order on the Scott domain is not a well-quasi-order
Cited In (7)
- PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
- On the main scientific achievements of Victor Selivanov
- Extending Wagner's hierarchy to deterministic visibly pushdown automata
- Input-Driven Pushdown Automata with Limited Nondeterminism
- On the determinization of event-clock input-driven pushdown automata
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Input-driven pushdown automata on well-nested infinite strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117102)
