Unambiguity in automata theory
From MaRDI portal
Publication:5500675
DOI10.1007/978-3-319-19225-3_1zbMATH Open1432.68222OpenAlexW1108093586MaRDI QIDQ5500675FDOQ5500675
Authors: Thomas Colcombet 
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
Recommendations
Cites Work
- Elements of automata theory. Translated from the French by Reuben Thomas
- Title not available (Why is that?)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- Rabin's uniformization problem
- MSO on the Infinite Binary Tree: Choice and Order
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding Equivalence of Finite Tree Automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- On the definition of a family of automata
- Title not available (Why is that?)
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Polynomial closure and unambiguous product
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Finite-memory automata
- Making Nondeterminism Unambiguous
- Descriptional complexity of machines with limited resources
- What's decidable about weighted automata?
- Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- Unambiguous Büchi automata.
- Automata and temporal logic over arbitrary linear time
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Succinct representation of regular languages by Boolean automata
- Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
- Descriptional complexity of unambiguous input-driven pushdown automata
- Title not available (Why is that?)
- Unambiguous automata inference by means of state-merging methods.
- Choice functions and well-orderings over the infinite binary tree
- Games for the \(\mu\)-calculus
- Unambiguous constrained automata
- Title not available (Why is that?)
- Series which are both max-plus and min-plus rational are unambiguous
- Forms of determinism for automata
- Structurally Unambiguous Finite Automata
- Title not available (Why is that?)
- Weighted automata
- Fraenkel-Mostowski sets with non-homogeneous atoms
Cited In (29)
- Forms of determinism for automata
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Orbit-finite-dimensional vector spaces and weighted register automata
- On complementing unambiguous automata and graphs with many cliques and cocliques
- Operations on Unambiguous Finite Automata
- Title not available (Why is that?)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
- Image-binary automata
- Unambiguous Büchi automata.
- The big-O problem
- Operations on Unambiguous Finite Automata
- Unambiguity in Timed Regular Languages: Automata and Logics
- The big-O problem for labelled Markov chains and weighted automata
- Markov chains and unambiguous automata
- Universality Problem for Unambiguous VASS
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
- The containment problem for unambiguous register automata
- The containment problem for unambiguous register automata and unambiguous timed automata
- On history-deterministic one-counter nets
- Solvability of orbit-finite systems of linear equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On degrees of ambiguity for Büchi tree automata
- Title not available (Why is that?)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
- Solving string problems on graphs using the labeled direct product
- Unambiguous automata
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- Nominal automata with name binding
This page was built for publication: Unambiguity in automata theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500675)
