Ambiguity hierarchy of regular infinite tree languages
From MaRDI portal
(Redirected from Publication:5155680)
Recommendations
Cites work
- Ambiguity, nondeterminism and state complexity of finite automata
- Choice functions and well-orderings over the infinite binary tree
- Decidability of Second-Order Theories and Automata on Infinite Trees
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Expressing cardinality quantifiers in monadic second-order logic over trees
- scientific article; zbMATH DE number 6680130 (Why is no real title available?)
- scientific article; zbMATH DE number 176157 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- MSO on the Infinite Binary Tree: Choice and Order
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Rabin's uniformization problem
- Rational \(\omega\)-languages are non-ambiguous
- Succinct representation of regular languages by Boolean automata
- Testing and generating infinite sequences by a finite automaton
- Unambiguity in automata theory
- Unambiguous languages exhaust the index hierarchy
This page was built for publication: Ambiguity hierarchy of regular infinite tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155680)