Intersection and union of regular languages and state complexity
Information Processing Letters
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences
State complexity of combined operations
Theoretical Computer Science
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Magic Numbers and Ternary Alphabet
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Finite automata and their decision problems
IBM Journal of Research and Development
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Hi-index | 0.00 |
In this paper we study the subset construction that transforms nondeterministic finite automata (NFA) to deterministic finite automata (DFA). It is well known that given a n-state NFA, the subset construction algorithm produces a 2n-state DFA in the worst case. It has been shown that given n, m (n m ≤ 2n), there is a n-state NFA N such that the minimal DFA recognizing L(N) has m states. However this construction requires O(n2) number of transitions in the worst case. We give an alternative solution to this problem that requires asymptotically fewer transitions. We also investigate the question of the complementation of NFA. In this case also, it known that given n, m (n m ≤ 2n), there exists a n-state NFA N such that the minimal NFA recognizing the complement of L(N) needs m states. We provide regular languages such that given n, k (k 1 and n k), the NFA recognizing these languages need n states and the NFA recognizing their complement needs (k + 1)n − (k + 1)2 + 2 states. Finally we show that for given n, k 1, there exists a O(n)-state NFA A such that the minimal NFA recognizing the complement of L(A) has between O(nk−1) and O(n2k) states. Importantly however, the constructed NFA's have a small number of transitions, typically in the order of O(n) or O(n2/log2(n)). These are better than the comparable results in the literature.