论文信息 - Homomorphisms Preserving Deterministic Context-Free Languages

Homomorphisms Preserving Deterministic Context-Free Languages

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 f...

Alexander Okhotin | Tommi Lehtinen

[1] Daniel J. Rosenkrantz,et al. Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[2] Zoltán Fülöp,et al. Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers , 2008, J. Autom. Lang. Comb..

[3] Ludwig Staiger,et al. On Infinitary Finite Length Codes , 1986, RAIRO Theor. Informatics Appl..

[4] Alexander Okhotin,et al. Boolean Grammars and GSM Mappings , 2010, Int. J. Found. Comput. Sci..

[5] M. P. Schützenberger. On a question concerning certain free submonoids , 1966 .

[6] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1966, Inf. Control..

[7] Joseph S. Ullian,et al. Preservation of unambiguity and inherent ambiguity in context-free languages , 1966, JACM.

[8] Antonio Restivo,et al. A Combinatorial Property of Codes Having Finite Synchronization Delay , 1975, Theor. Comput. Sci..

[9] Alexander Okhotin,et al. On the equivalence of linear conjunctive grammars and trellis automata , 2004, RAIRO Theor. Informatics Appl..

[10] Vèronique Bruyère. Maximal Codes With Bounded Deciphering Delay , 1991, Theor. Comput. Sci..