Abstract
Semi-extended regular expressions (SEREs) are regular expressions (REs) with intersection. Two algorithms for translating REs into nondeterministic finite automata (NFAs) are widely known, that is, Thompson construction and Glushkov construction. A trivial way for translating SEREs into NFAs is to use Thompson construction because it can easily be applied to SEREs. It seems to be difficult to directly apply Glushkov construction to SEREs. In this paper, we present a new translation from SEREs into NFAs using Glushkov construction and the modular decomposition technique by Yamamoto. Then, given an SERE r with m r intersection operators, we can generate an NFA with at most N r +1 states and \(N^2_r\) transitions in \(O((m_r + 1)N^2_r)\) time and space. Here N r is a number obtained from the decomposition of r, and is less than the number of states of an NFA obtained by the trivial translation (that is, the translation using Thompson construction). In addition, we will show an application to an approximate SERE matching problem.
This research has been supported by the REFEC
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V.: Algorithms for finding patterns in strings. In: Leeuwen, J.V. (ed.) Handbook of theoretical computer science, Elsevier Science Pub., Amsterdam (1990)
Bruggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 120, 197–213 (1993)
Chang, C.H., Paige, R.: From regular expressions to DFA’s using compressed NFA’s. Theoret. Comput. Sci. 178, 1–36 (1997)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)
Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory language and computation. Addison Wesley, Reading (1979)
Myers, E., Miller, W.: Approximate Matching of Regular Expressions. Bull. of Mathematical Biology 51(1), 5–37 (1989)
Navarro, G., Raffinot, M.: Compact DFA Representation for Fast Regular Expression Search. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 1–12. Springer, Heidelberg (2001)
Wu, S., Manber, U.: Fast Text Searching Allowing Errors. Communications of the ACM 35(10), 83–91 (1992)
Wu, S., Manber, U., Myers, E.: A Sub-Quadratic Algorithm for Approximate Regular Expression Matching. J. of Algorithm 19, 346–360 (1995)
Yamamoto, H.: A New Recognition Algorithm for Extended Regular Expressions. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 257–267. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, H. (2003). A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem . In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive