The following pages link to Unambiguity in Automata Theory (Q5500675):
Displaying 27 items.
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Unambiguous automata (Q942992) (← links)
- Unambiguous Büchi automata. (Q1401292) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- Image-binary automata (Q2096597) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- On complementing unambiguous automata and graphs with many cliques and cocliques (Q2671818) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Unambiguity in Timed Regular Languages: Automata and Logics (Q3588092) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- (Q5028487) (← links)
- Universality Problem for Unambiguous VASS (Q5089303) (← links)
- (Q5089308) (← links)
- (Q5089311) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- (Q5094125) (← links)
- (Q5155680) (← links)
- (Q5271416) (← links)
- Markov chains and unambiguous automata (Q6098148) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q6535954) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
- Orbit-finite-dimensional vector spaces and weighted register automata (Q6566474) (← links)
- Solvability of orbit-finite systems of linear equations (Q6649440) (← links)
