Pages that link to "Item:Q703504"
From MaRDI portal
The following pages link to Bideterministic automata and minimal representations of regular languages (Q703504):
Displaying 15 items.
- Quotients and atoms of reversible languages (Q2139050) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- Deterministic biautomata and subclasses of deterministic linear languages (Q2278286) (← links)
- Identification of birfsa languages. (Q2490821) (← links)
- Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA (Q3538856) (← links)
- Bideterministic Automata and Minimal Representations of Regular Languages (Q3559792) (← links)
- Some Minimality Results on Biresidual and Biseparable Automata (Q3564897) (← links)
- Minimal NFA and biRFSA Languages (Q3625690) (← links)
- On Transition Minimality of Bideterministic Automata (Q5428251) (← links)
- Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language (Q5874410) (← links)
- Bideterministic weighted automata (Q6108730) (← links)
- Binary completely reachable automata (Q6109017) (← links)
- Bideterministic weighted automata (Q6186321) (← links)
- Yet another canonical nondeterministic automaton (Q6499548) (← links)