Extending Wagner's hierarchy to deterministic visibly pushdown automata

DOI10.1007/978-3-031-36978-0_16MaRDI QIDQ6149043zbMATH OpenOpenAlexFDO

Authors Victor Selivanov

Publication date 12 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-36978-0_16

zbMATH Keywords

\(k\)-partitionWadge reducibilityvisibly pushdown automaton\( \omega \)-languagestack heightWagner's hierarchy

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Recommendations

• A hierarchy of deterministic context-free \(\omega\)-languages.
• A Fine Hierarchy of ω-Regular k-Partitions
• The Wadge Hierarchy of Deterministic Tree Languages
• The Wadge Hierarchy of Deterministic Tree Languages
• Wadge-Wagner hierarchies

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 Fine Hierarchy of ω-Regular k-Partitions
• A hierarchy of deterministic context-free \(\omega\)-languages.
• Adding nesting structure to words
• Extending Wadge theory to \(k\)-partitions
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Hierarchies and reducibilities on regular languages related to modulo counting
• Input-Driven Pushdown Automata with Limited Nondeterminism
• Input-driven pushdown automata on well-nested infinite strings
• On the Wadge reducibility of \(k\)-partitions
• On the structure of the Wadge degrees of bqo-valued Borel functions
• On ω-regular sets
• Topological complexity of context-free \(\omega \)-languages: a survey
• Visibly pushdown languages
• Wadge Degrees ofω-Languages of Deterministic Turing Machines

This page was built for publication: Extending Wagner's hierarchy to deterministic visibly pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149043)