Geoffrey Smith
ABSTRACT
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. This paper describes work on fast search techniques for finding minimal NFAs. The foundation of our approach is a characterization theorem for NFAs: we prove that a language is recognized by an n-state NFA iff it has what we call an inductive basis of size n. Using this characterization, we develop a fast incremental search for minimal NFAs for unary languages. We study the performance of our search algorithm experimentally, showing that, as compared with exhaustive search, it cuts the search space dramatically.
- Hopcroft, J. E.: An n log n algorithm for minimizing the states in a finite automaton. In Kohavi, Z., ed.: The Theory of Machines and Computations. Academic Press, New York (1971) 189--196Google Scholar
- Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: Proceedings 5th ACM Symposium on Theory of Computing. (1973) 1--9 Google ScholarDigital Library
- Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing 22 (1993) 1117--1141 Google ScholarDigital Library
- Gramlich, G.: Probabilistic and nondeterministic unary automata. In: Proceedings of Mathematical Foundations of Computer Science. Volume 2747 of Lecture Notes in Computer Science., Springer-Verlag (2003) 460--469Google Scholar
- Matz, O., Potthoff, A.: Computing small nondeterministic finita automata. In: Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems. (1995) 74--88Google Scholar
- Ilie, L., Yu, S.: Algorithms for computing small NFAs. In: MFCS '02: Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science. (2002) 328--340 Google ScholarDigital Library
- Hopcroft, J. E., Ullman, J. D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979) Google ScholarDigital Library
- Perrin, D.: Finite automata. In van Leeuwen, J., ed.: Handbook of Theoretical Computer Science. Volume B: Formal Models and Semantics Elsevier Science Publishers (1990) 1--57 Google ScholarDigital Library
- Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bulletin of the EATCS 47 (1992) 166--169Google Scholar
- Conway, J. H.: Regular Algebra and Finite Machines. Chapman and Hall Ltd (1971)Google Scholar
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C.: Introduction to Algorithms, Second Edition. MIT Press (2001) Google ScholarDigital Library
Index Terms
- Inductive bases and their application to searches for minimal unary NFAs
Recommendations
Ambiguity of unary symmetric difference NFAs
ICTAC'11: Proceedings of the 8th international conference on Theoretical aspects of computingOkhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite ...
Minimization of unary symmetric difference NFAs
SAICSIT '04: Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countriesWe investigate the minimization of unary symmetric difference nondeterministic finite automata. To this end, we develop a modification of the Berlekamp-Massey algorithm. We then prove that, given a unary symmetric difference nondeterministic finite ...
Operational state complexity of unary NFAs with finite nondeterminism
We study the state complexity of language operations for unary NFAs with limited nondeterminism. We consider the Boolean operations, concatenation, and Kleene star. We give upper bounds for the state complexity of these language operations and lower ...
Comments