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.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 16th International Conference, DLT 2012, Proceedings
Pages154-165
Number of pages12
DOIs
StatePublished - 2012
Externally publishedYes
Event16th International Conference on Developments in Language Theory, DLT 2012 - Taipei, Taiwan, Province of China
Duration: 14 Aug 201217 Aug 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7410 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Developments in Language Theory, DLT 2012
Country/TerritoryTaiwan, Province of China
CityTaipei
Period14/08/1217/08/12

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

ID: 78945231