Homomorphisms preserving deterministic context-free languages
From MaRDI portal
Recommendations
Cites work
- A combinatorial property of codes having finite synchronization delay
- A further note on top-down deterministic languages
- Boolean grammars and gsm mappings
- Deterministic context free languages
- Maximal codes with bounded deciphering delay
- On a question concerning certain free submonoids
- On infinitary finite length codes
- On the equivalence of linear conjunctive grammars and trellis automata
- Preservation of unambiguity and inherent ambiguity in context-free languages
- Properties of deterministic top-down grammars
Cited in
(8)- On derivation preservation
- Preserving some languages' homomorphisms
- Homomorphisms Preserving Deterministic Context-Free Languages
- scientific article; zbMATH DE number 4043273 (Why is no real title available?)
- scientific article; zbMATH DE number 1870552 (Why is no real title available?)
- Homomorphisms preserving linear conjunctive languages
- The Hardest LL(k) Language
- The hardest \(\operatorname{LL}(k)\) language
This page was built for publication: Homomorphisms preserving deterministic context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495419)