The following pages link to Forms of determinism for automata (Q2904745):
Displaying 20 items.
- Testing DNA code words properties of regular languages (Q896711) (← links)
- Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
- Determinism and fuzzy automata (Q1857094) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- Width of Non-deterministic Automata (Q3304146) (← links)
- On Determinisation of Good-for-Games Automata (Q3449484) (← links)
- On the Strength of Unambiguous Tree Automata (Q4683238) (← links)
- (Q5002827) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
- (Q5207047) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- (Q5875380) (← links)
- Markov chains and unambiguous automata (Q6098148) (← links)
- Determinism and Nondeterminism in Finite Automata with Advice (Q6163614) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)