Journalartikel
Autorenliste: Bordihn, Henning; Dassow, Juergen; Holzer, Markus
Jahr der Veröffentlichung: 2010
Seiten: 229-255
Zeitschrift: RAIRO: Theoretical Informatics and Applications
Bandnummer: 44
Heftnummer: 2
ISSN: 0988-3754
eISSN: 1290-385X
Open Access Status: Green
DOI Link: https://doi.org/10.1051/ita/2010013
Verlag: 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.
Zitierstile
Harvard-Zitierstil: 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-Zitierstil: 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
Schlagwörter
Complexity; computational complexity; CONTEXT-FREE LANGUAGES; homomorphic replacement; IO; REGULAR LANGUAGES