Publication:2117102

DOI10.1007/978-3-030-79416-3_21OpenAlexW3175969508MaRDI QIDQ2117102

Alexander Okhotin, Victor L. Selivanov

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_21

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

On the main scientific achievements of Victor Selivanov, Extending Wagner's hierarchy to deterministic visibly pushdown automata, Unnamed Item, On the determinization of event-clock input-driven pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Descriptional complexity of unambiguous input-driven pushdown automata
• A hierarchy of deterministic context-free \(\omega\)-languages.
• State complexity of operations on input-driven pushdown automata
• Input-Driven Pushdown Automata with Limited Nondeterminism
• Visibly pushdown languages
• Adding Nesting Structure to Words
• On ω-regular sets
• THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Topological Complexity of Context-Free ω-Languages: A Survey
• Wadge-like reducibilities on arbitrary quasi-Polish spaces