Abstract
Several programming languages, such as Perl and Java, provides an extended variation of regular expressions to match patterns in a text. We study one such extension, Regex expression, that includes back-reference operator in addition to standard regular expression operations. Although matching a regular expression can be done in polynomial time, it is known to be NP-complete for Regex expressions. We study decidability properties for Regex languages and show that it is not possible to improve matching complexity based on semantic analysis of Regex expressions. We also give an algorithm for matching that is efficient for certain types of Regex. We compare our results with another algorithm proposed earlier.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Aho, A.V.: Algorithms for finding patterns in strings, pp. 275–300. MIT Press, Cambridge (1990)
Câmpeanu, C., Santean, N.: On the intersection of regex languages with regular languages. Theoretical Computer Science 410, 2336–2344 (2009)
Freydenberger, D.D.: Extended Regular Expressions: Succinctness and Decidability. In: 28th International Symposium on Theoretical Aspects of Computer Science, Dagstuhl, Germany. Leibniz International Proceedings inInformatics (LIPIcs), vol. 9, pp. 507–518. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2011)
Ginsburg, S., Greibach, S.: Deterministic context free languages. Information and Control 9(6), 620–648 (1966)
Ginsburg, S., Rose, G.F.: Operations which preserve definability in languages. Journal of the ACM 10(2), 175–195 (1963)
Greibach, S.: A note on undecidable properties of formal languages. Theory of Computing Systems 2, 1–6 (1968)
Hopcroft, J.E., Ullman, J.D.: Introduction To Automata. In: Theory, Languages, And Computation, 3rd edn., Pearson Education (2008)
Reidenbach, D., Schmid, M.L.: A polynomial time match test for large classes of extended regular expressions. In: 15th International Conference on Implementation and Application of Automata, pp. 241–250. Springer (2011)
Thompson, K.: Programming techniques: Regular expression search algorithm. Communications of the ACM 11, 419–422 (1968)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer India
About this paper
Cite this paper
Alevoor, P., Sarda, P., Kapoor, K. (2013). On Decidability and Matching Issues for Regex Languages. In: Kumar M., A., R., S., Kumar, T. (eds) Proceedings of International Conference on Advances in Computing. Advances in Intelligent Systems and Computing, vol 174. Springer, New Delhi. https://doi.org/10.1007/978-81-322-0740-5_18
Download citation
DOI: https://doi.org/10.1007/978-81-322-0740-5_18
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-0739-9
Online ISBN: 978-81-322-0740-5
eBook Packages: EngineeringEngineering (R0)