Homomorphisms preserving linear conjunctive languages

Authors:
Alexander Okhotin
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland and Academy of Finland
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2008

Citing 6
Cited 1

On real-time cellular automata and trellis automata

Acta Informatica
Systolic Trellis automata: stability, decidability and complexity

Information and Control
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Conjunctive Grammars and Systems of Language Equations

Programming and Computing Software
On the closure properties of linear conjunctive languages

Theoretical Computer Science
Boolean grammars

Information and Computation

Homomorphisms preserving deterministic context-free languages

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is proved that a homomorphism h preserves the class of languages generated by linear conjunctive grammars (equivalently, recognized by trellis automata, also known as one-way real-time cellular automata) if and only if either h is injective, or h maps every symbol to the empty string. The transformation is effective in the former case and cannot be effectively done in the latter case.