A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Homomorphisms preserving deterministic context-free languages
Tekijät: Tommi Lehtinen, Alexander Okhotin
Julkaisuvuosi: 2013
Journal: International Journal of Foundations of Computer Science
Lehden akronyymi: IJFCS
Numero sarjassa: 7
Vuosikerta: 24
Numero: 7
Aloitussivu: 1049
Lopetussivu: 1066
Sivujen määrä: 18
ISSN: 0129-0541
DOI: https://doi.org/10.1142/S0129054113400303
Tiivistelmä
The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free languages and the unambiguous context-free languages are closed. The family of deterministic context-free languages is closed under a homomorphism h if and only if h is either a code of bounded deciphering delay, or the images of all symbols under h are powers of the same string. The same characterization holds for LL context-free languages. The unambiguous context-free languages are closed under h if and only if either h is a code, or the images of all symbols under h are powers of the same string.
The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free languages and the unambiguous context-free languages are closed. The family of deterministic context-free languages is closed under a homomorphism h if and only if h is either a code of bounded deciphering delay, or the images of all symbols under h are powers of the same string. The same characterization holds for LL context-free languages. The unambiguous context-free languages are closed under h if and only if either h is a code, or the images of all symbols under h are powers of the same string.
Turun yliopiston Tutkimustietojärjestelmän portaali