Extending Wagner's hierarchy to deterministic visibly pushdown automata

DOI10.1007/978-3-031-36978-0_16OpenAlexW4384789271MaRDI QIDQ6149043

Victor L. 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)

Cites Work

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

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