THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET

Related Items

On the Size of One-way Quantum Finite Automata with Periodic Behaviors, Quotients and atoms of reversible languages, Minimizing nfa's and regular expressions, Operational state complexity of unary NFAs with finite nondeterminism, The tractability frontier for NFA minimization, Unambiguous finite automata over a unary alphabet, Pairs of complementary unary languages with ``balanced nondeterministic automata, A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton, A note on the space complexity of some decision problems for finite automata, NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs, Nondeterministic syntactic complexity, A lower bound technique for the size of nondeterministic finite automata, Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited, Complementing unary nondeterministic automata, Some results on the structure of unary unambiguous automata, Investigations on Automata and Languages Over a Unary Alphabet, Descriptional and computational complexity of finite automata -- a survey, Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity, Descriptional and Computational Complexity of Finite Automata, Deterministic generalized automata, Nondeterministic Tree Width of Regular Languages