Abstract
Let E be a regular expression the size of which is s. Mirkin’s prebases and Antimirov’s partial derivatives lead to the construction of the same automaton, called the equation automaton of E. The number of states in this automaton is less than or equal to the number of states in the position automaton. On the other hand, it can be computed by Antimirov’s algorithm with an O(s 5) time complexity, whereas there exist O(s 2) implementations for the position automaton. We present an O(s 2) space and time algorithm to compute the equation automaton. It is based on the notion of canonical derivative which is related both to word and partial derivatives. This work is tightly connected to pattern matching area since the aim is, given a regular expression, to produce an as small as possible recognizer with the best space and time complexity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983.
J.-M. Autebert et J.-M. Rifflet. Dérivations Formelles des Expressions Rxationnelles: Un Programme de Calcul Automatique. Rapport LITP 78(14), 1978.
V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci., 155:291–319, 1996.
D. Beauquier, J. Berstel, and P. Chrétienne. Éléments d’Algorithmique. Masson, Paris, 1992.
A. Brüggemann-Klein, Regular Expressions into Finite Automata. Theoret. Comput. Sci., 120 (1993), 197–213.
G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoret. Comput. Sci., 48(1):117–126, 1986.
J.A. Brzozowski. Derivatives of regular expressions. J. Assoc. Comput. Mach., 11(4):481–494, 1964.
C.-H. Chang and R. Paige. From Regular Expressions to DFAs using Compressed NFAs, in Apostolico. Crochemore. Galil. and Manber. editors. Lecture Notes in Computer Science, 644 (1992), 88–108.
J.-M. Champarnaud and D. Ziadi. New Finite Automaton Constructions Based on Canonical Derivatives, in CIAA’2000, Lecture Notes in Computer Science, S. Yu ed., Springer-Verlag, to appear.
M. Crochemore and C. Hancart. Automata for matching patterns. Handbook of Formal Languages, G. Rozenberg and A. Salomaa eds., (A.), chap. 9, 399–462, Springer-Verlag, Berlin, 1997.
V.M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1–53, 1961.
C. Hagenah and A. Muscholl, Computing ε-free NFA from Regular Expressions in O(nlog2(n)) Time, in: L. Prim et al. (eds.), MFCS’98, Lecture Notes in Computer Science, 1450 (1998), 277–285, Springer.
C. Hagenah and A. Muscholl, Computing ε-free NFA from Regular Expressions in O(nlog2(n)) Time, RAIRO-TIA, 34/4 (2000), 257–278.
J. Hromkovič, S. Seibert and T. Wilke, Translating regular expressions into small ε-free nondeterministic finite automata, in: R. Reischuk (ed.), STACS’97, Lecture Notes in Computer Science, 1200 (1997), 55–66, Springer.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979.
S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies 34:3–41, 1956. Princeton U. Press.
R.F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39–57, March 1960.
B.G. Mirkin. An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics, 5:110–116, 1966.
R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6), 1987.
J.-L. Ponty, D. Ziadi and J.-M. Champarnaud, A new Quadratic Algorithm to convert a Regular Expression into an Automaton, In: D. Raymond and D. Wood, eds., Proc.WIA’96, Lecture Notes in Computer Science, Vol. 1260 (1997) 109–119.
B. Watson, Taxonomies and Toolkits of Regular Languages Algorithms, PhD thesis, Eindhoven University of Technology, The Nederlands, 1995.
S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, Word, Language, Grammar, pages 41–110. Springer-Verlag, Berlin, 1997.
D. Ziadi, J.-L. Ponty, and J.-M. Champarnaud. Passage d’une expression rationnelle à un automate fini non-déterministe. Journées Montoises (1995), Bull. Belg. Math. Soc., 4:177–203, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Champarnaud, JM., Ziadi, D. (2001). Computing the Equation Automaton of a Regular Expression in O(s 2) Space and Time. In: Amir, A. (eds) Combinatorial Pattern Matching. CPM 2001. Lecture Notes in Computer Science, vol 2089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48194-X_15
Download citation
DOI: https://doi.org/10.1007/3-540-48194-X_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42271-6
Online ISBN: 978-3-540-48194-2
eBook Packages: Springer Book Archive