Extending Wagner's hierarchy to deterministic visibly pushdown automata

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

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

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

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

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

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)