Pages that link to "Item:Q418147"
From MaRDI portal
The following pages link to Unambiguous finite automata over a unary alphabet (Q418147):
Displayed 17 items.
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
- On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Ambiguity and structural ambiguity of symmetric difference NFAs (Q2453538) (← links)
- Logarithmic asymptotics of Landau-Okhotin function (Q2694876) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← 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)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)