Extending regular expressions with homomorphic replacement
RAIRO-Theor. Inf. Appl., 44 2 (2010) 229-255
Published online: 2010-01-26
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the computational and descriptional complexity of multi-pattern languages
Jingnan Xie, Harry B. Hunt and Richard E. StearnsTheoretical Computer Science 1030 115063 (2025)
https://doi.org/10.1016/j.tcs.2025.115063
Characterising REGEX languages by regular languages equipped with factor-referencing
Markus L. SchmidInformation and Computation 249 1 (2016)
https://doi.org/10.1016/j.ic.2016.02.003
Developments in Language Theory
Markus L. SchmidLecture Notes in Computer Science, Developments in Language Theory 8633 142 (2014)
https://doi.org/10.1007/978-3-319-09698-8_13
Extended Regular Expressions: Succinctness and Decidability
Dominik D. FreydenbergerTheory of Computing Systems 53 (2) 159 (2013)
https://doi.org/10.1007/s00224-012-9389-0
INSIDE THE CLASS OF REGEX LANGUAGES
MARKUS L. SCHMIDInternational Journal of Foundations of Computer Science 24 (07) 1117 (2013)
https://doi.org/10.1142/S0129054113400340
Language and Automata Theory and Applications
Daniel Reidenbach and Markus L. SchmidLecture Notes in Computer Science, Language and Automata Theory and Applications 7183 468 (2012)
https://doi.org/10.1007/978-3-642-28332-1_40
Developments in Language Theory
Markus L. SchmidLecture Notes in Computer Science, Developments in Language Theory 7410 73 (2012)
https://doi.org/10.1007/978-3-642-31653-1_8