Abstract
We give new methods for constructing small nondeterministic finite automata (NFA) from regular expressions or from other NFAs. Given an arbitrary NFA, we compute the largest right-invariant equivalence on the states and then merge the states in the same class to obtain a smaller automaton. When applying this method to position automata, we get a way to convert regular expressions into NFAs which can be arbitrarily smaller than the position, partial derivative, and follow automata. In most cases, it is smaller than all NFAs obtained by similar constructions.
Research partially supported by NSERC grant R3143A01.
Research partially supported by NSERC grant OGP0041630.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A., Sethi, R., Ullman, J., Compilers: Principles, Techniques, and Tools, Addison-Wesley, MA, 1988.
Antimirov, V., Partial derivatives of regular expressions and finite automaton constructions, Theoret. Comput. Sci. 155 (1996) 291–319.
Berry, G, Sethi, R., From regular expressions to deterministic automata, Theoret. Comput. Sci. 48 (1986) 117–126.
Brüggemann-Klein, A., Regular expressions into finite automata, Theoret. Comput. Sci. 120(1993) 197–213.
Brzozowski, J., Derivatives of regular expressions, J. ACM 11 (1964) 481–494.
Champarnaud, J.-M., Ziadi, D., New finite automaton constructions based on canonical derivatives, in: S. Yu, A. Paun, eds., Proc. of CIAA 2000, Lecture Notes in Comput. Sci. 2088, Springer-Verlag, Berlin, 2001, 94–104.
Champarnaud, J.-M., Ziadi, D., Computing the equation automaton of a regular expression in \( \mathcal{O} \) space and time, in: A. Amir, G. Landau, Proc. of 12th CPM, Lecture Notes in Comput. Sci. 2089, Springer-Verlag, Berlin, 2001, 157–168.
Chang, C.-H., Paige, R., From regular expressions to DFA’s using compressed NFA’s, Theoret. Comput. Sci 178 (1997) 1–36.
Friedl, J., Mastering Regular Expressions, O’Reilly, 1998.
Glushkov, V.M., The abstract theory of automata, Russian Math. Surveys 16 (1961) 1–53.
Hagenah, C., Muscholl, A., Computing ε-free NFA from regular expressions in O(n log2(n)) time, Theor. Inform. Appl. 34(4) (2000) 257–277.
Hopcroft, J., An n log n algorithm for minimizing states in a finite automaton, Proc. Internat. Sympos. Theory of machines and computations, Technion, Haifa, 1971, Academic Press, New York, 1971, 189–196.
Hopcroft, J.E., Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
Hromkovic, J., Seibert, S., Wilke, T., Translating regular expressions into small ε-free nondeterministic finite automata, J. Comput. System Sci. 62(4) (2001) 565–588.
Ilie, L., Yu, S., Constructing NFAs by optimal use of positions in regular expressions, in: A. Apostolico, M. Takeda, Proc. of 13th CPM, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 2002, to appear.
McNaughton, R., Yamada, H., Regular expressions and state graphs for automata, IEEE Trans. on Electronic Computers 9(1) (1960) 39–47.
Sippu, S., Soisalon-Soininen, E., Parsing Theory: I Languages and Parsing, EATCS Monographs on Theoretical Computer Science, Vol. 15, Springer-Verlag, New York, 1988.
Thompson, K., Regular expression search algorithm, Comm. ACM 11(6) (1968) 419–422.
Yu, S., Regular Languages, in: G. Rozenberg, A. Salomaa, Handbook of Formal Languages, Vol. I, Springer-Verlag, Berlin, 1997, 41–110.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iliea, L., Yu, S. (2002). Algorithms for Computing Small NFAs. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive