Journal article
Authors list: Bordihn, Henning; Dassow, Juergen; Holzer, Markus
Publication year: 2010
Pages: 229-255
Journal: RAIRO: Theoretical Informatics and Applications
Volume number: 44
Issue number: 2
ISSN: 0988-3754
eISSN: 1290-385X
Open access status: Green
DOI Link: https://doi.org/10.1051/ita/2010013
Publisher: EDP Sciences
Abstract:
We define H- and EH-expressions as extensions of regular expressions by adding homomorphic and iterated homomorphic replacement as new operations, resp. The definition is analogous to the extension given by Gruska in order to characterize context-free languages. We compare the families of languages obtained by these extensions with the families of regular, linear context-free, context-free, and EDT0L languages. Moreover, relations to language families based on patterns, multi-patterns, pattern expressions, H-systems and uniform substitutions are also investigated. Furthermore, we present their closure properties with respect to TRIO operations and discuss the decidability status and complexity of fixed and general membership, emptiness, and the equivalence problem.
Citation Styles
Harvard Citation style: Bordihn, H., Dassow, J. and Holzer, M. (2010) EXTENDING REGULAR EXPRESSIONS WITH HOMOMORPHIC REPLACEMENT, RAIRO: Theoretical Informatics and Applications, 44(2), pp. 229-255. https://doi.org/10.1051/ita/2010013
APA Citation style: Bordihn, H., Dassow, J., & Holzer, M. (2010). EXTENDING REGULAR EXPRESSIONS WITH HOMOMORPHIC REPLACEMENT. RAIRO: Theoretical Informatics and Applications. 44(2), 229-255. https://doi.org/10.1051/ita/2010013
Keywords
Complexity; computational complexity; CONTEXT-FREE LANGUAGES; homomorphic replacement; IO; REGULAR LANGUAGES