Input-driven pushdown automata on well-nested infinite strings

DOI10.1007/978-3-030-79416-3_21MaRDI QIDQ2117102zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3885334 (Why is no real title available?)
• scientific article; zbMATH DE number 3696500 (Why is no real title available?)
• A hierarchy of deterministic context-free \(\omega\)-languages.
• Adding Nesting Structure to Words
• Descriptional complexity of unambiguous input-driven pushdown automata
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Input-Driven Pushdown Automata with Limited Nondeterminism
• On ω-regular sets
• State complexity of operations on input-driven pushdown automata
• The Wadge order on the Scott domain is not a well-quasi-order
• Topological complexity of context-free \(\omega \)-languages: a survey
• Visibly pushdown languages
• Wadge-like reducibilities on arbitrary quasi-Polish spaces

Cited in

(7)

• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• Input-Driven Pushdown Automata with Limited Nondeterminism
• On the main scientific achievements of Victor Selivanov
• Extending Wagner's hierarchy to deterministic visibly pushdown automata
• On the determinization of event-clock input-driven pushdown automata
• scientific article; zbMATH DE number 7770056 (Why is no real title available?)
• scientific article; zbMATH DE number 7058469 (Why is no real title available?)

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)