HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES

DOI10.1142/S0129054113400303zbMath1360.68610MaRDI QIDQ5495419

Tommi Lehtinen, Alexander Okhotin

Publication date: 4 August 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

context-free grammarsclosure propertiescoding theorybounded deciphering delay

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Related Items (2)

The hardest \(\operatorname{LL}(k)\) language ⋮ The Hardest LL(k) Language

Cites Work

• Maximal codes with bounded deciphering delay
• A combinatorial property of codes having finite synchronization delay
• BOOLEAN GRAMMARS AND GSM MAPPINGS
• 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
• Deterministic context free languages
• On a question concerning certain free submonoids
• Properties of deterministic top-down grammars
• A further note on top-down deterministic languages

This page was built for publication: HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES