Homomorphisms preserving linear conjunctive languages

DOI10.25596/JALC-2008-299MaRDI QIDQ5192986zbMATH OpenFDO

Authors Alexander Okhotin

Publication date 10 August 2009

Full work available at URL https://doi.org/10.25596/JALC-2008-299

zbMATH Keywords

one-way real-time cellular automatatrellis automata

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Recommendations

• Preserving some languages' homomorphisms
• Homomorphisms Preserving Deterministic Context-Free Languages
• Homomorphisms preserving deterministic context-free languages
• scientific article; zbMATH DE number 1346364
• On the closure properties of linear conjunctive languages.

Cited in

(10)

• Preservation by homomorphisms and infinitary languages
• Computational completeness of equations over sets of natural numbers
• Recognition of poly-slender context-free languages by trellis automata
• Preserving some languages' homomorphisms
• Homomorphisms Preserving Deterministic Context-Free Languages
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• scientific article; zbMATH DE number 2050936 (Why is no real title available?)
• Some property-preserving homomorphisms
• Unambiguous conjunctive grammars over a one-symbol alphabet
• Linear grammars with one-sided contexts and their automaton representation

This page was built for publication: Homomorphisms preserving linear conjunctive languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5192986)