Schmid_DLT_2012.pdf (342.77 kB)
Inside the class of REGEX Languages
journal contribution
posted on 2012-09-06, 08:10 authored by Markus L. SchmidWe study different possibilities of combining the concept of homomorphic replacement with regular expressions in order to investigate the class of languages given by extended regular expressions with backreferences (REGEX). It is shown in which regard existing and natural ways to do this fail to reach the expressive power of REGEX. Furthermore, the complexity of the membership problem for REGEX with a bounded number of backreferences is considered.
History
School
- Science
Department
- Computer Science
Citation
SCHMID, M.L., 2012. Inside the class of REGEX Languages. IN: Yen, H.-C. and Ibarra, O.H. (eds.) Developments in Language Theory. Lecture Notes in Computer Science, 7410, pp. 73 - 84.Publisher
© SpringerVersion
- AM (Accepted Manuscript)
Publication date
2012Notes
This conference paper was presented at the 16th International Conference, DLT 2012 Taipei, Taiwan, August 14-17, 2012 and published as a book chapter in Developments in Language Theory, Lecture Notes in Computer Science [© Springer]. The definitive version is available at: www.springerlink.com.ISBN
978-3-642-31652-4ISSN
0302-9743eISSN
1611-3349Publisher version
Book series
Lecture Notes in Computer Science;7410Language
- en
