Journal article

EXTENDING REGULAR EXPRESSIONS WITH HOMOMORPHIC REPLACEMENT


Authors listBordihn, Henning; Dassow, Juergen; Holzer, Markus

Publication year2010

Pages229-255

JournalRAIRO: Theoretical Informatics and Applications

Volume number44

Issue number2

ISSN0988-3754

eISSN1290-385X

Open access statusGreen

DOI Linkhttps://doi.org/10.1051/ita/2010013

PublisherEDP 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 styleBordihn, 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 styleBordihn, 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


Complexitycomputational complexityCONTEXT-FREE LANGUAGEShomomorphic replacementIOREGULAR LANGUAGES

Last updated on 2025-10-06 at 09:54