Regular sets over extended tree structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3880651 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3562528 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 2038738 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- scientific article; zbMATH DE number 2102748 (Why is no real title available?)
- A Note on Pushdown Store Automata and Regular Systems
- An automata-theoretical characterization of the OI-hierarchy
- Counter-free automata, first-order logic, and star-free expressions extended by prefix oracles
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Expressive power of monadic logics on words, trees, pictures, and graphs
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Full AFLs and nested iterated substitution
- Fundamental properties of infinite trees
- Iterated pushdown automata and sequences of rational numbers
- Iterated stack automata and complexity classes
- Linear Orders in the Pushdown Hierarchy
- Mathematical Foundations of Computer Science 2003
- Mathematical Foundations of Computer Science 2005
- Monadic second-order logic on tree-like structures
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Nested Stack Automata
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- On infinite transition graphs having a decidable monadic theory
- On the Borel complexity of MSO definable sets of branches
- Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
- Positional Strategies for Higher-Order Pushdown Parity Games
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
- Selection in the monadic theory of a countable ordinal
- Selection over classes of ordinals expanded by monadic predicates
- Solving Sequential Conditions by Finite-State Strategies
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
- The monadic second-order logic of graphs. IX: Machines and their behaviours
- The monadic theory of morphic infinite words and generalizations
- Uniformization and skolem functions in the class of trees
- Uniformization, choice functions and well orders in the class of trees
Cited in
(8)- Monadic second order logic on tree-like structures
- Transforming structures by set interpretations
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 2090069 (Why is no real title available?)
- A Combinatorial Theorem for Trees
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Measure properties of regular sets of trees
- Counter-free automata, first-order logic, and star-free expressions extended by prefix oracles
This page was built for publication: Regular sets over extended tree structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764339)
