Pages that link to "Item:Q3988841"
From MaRDI portal
The following pages link to THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET (Q3988841):
Displayed 21 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Some results on the structure of unary unambiguous automata (Q544137) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- A lower bound technique for the size of nondeterministic finite automata (Q671381) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Deterministic generalized automata (Q1285583) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Quotients and atoms of reversible languages (Q2139050) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs (Q5704371) (← links)
- Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)