Unambiguity in Automata Theory
From MaRDI portal
Publication:5500675
DOI10.1007/978-3-319-19225-3_1zbMath1432.68222OpenAlexW1108093586MaRDI QIDQ5500675
Publication date: 7 August 2015
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_1
Related Items (20)
From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ On complementing unambiguous automata and graphs with many cliques and cocliques ⋮ On history-deterministic one-counter nets ⋮ Markov chains and unambiguous automata ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Nominal Automata with Name Binding ⋮ Unnamed Item ⋮ Operations on Unambiguous Finite Automata ⋮ A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The containment problem for unambiguous register automata and unambiguous timed automata ⋮ On degrees of ambiguity for Büchi tree automata ⋮ Operations on Unambiguous Finite Automata ⋮ Universality Problem for Unambiguous VASS ⋮ The Containment Problem for Unambiguous Register Automata ⋮ Solving string problems on graphs using the labeled direct product ⋮ Unnamed Item ⋮ Image-binary automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Descriptional complexity of unambiguous input-driven pushdown automata
- Choice functions and well-orderings over the infinite binary tree
- Games for the \(\mu\)-calculus
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Succinct representation of regular languages by Boolean automata
- Finite-memory automata
- Polynomial closure and unambiguous product
- Unambiguous Büchi automata.
- Weighted automata
- Forms of Determinism for Automata (Invited Talk)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- What’s Decidable about Weighted Automata?
- On the definition of a family of automata
- Rabin's uniformization problem
- Series which are both max-plus and min-plus rational are unambiguous
- Deciding Equivalence of Finite Tree Automata
- Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata
- MSO on the Infinite Binary Tree: Choice and Order
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Fraenkel-Mostowski Sets with Non-homogeneous Atoms
- Making Nondeterminism Unambiguous
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- UNAMBIGUOUS CONSTRAINED AUTOMATA
- Decidability of Second-Order Theories and Automata on Infinite Trees
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Structurally Unambiguous Finite Automata
- Machine Learning: ECML 2003
This page was built for publication: Unambiguity in Automata Theory
