Representation theorems using DOS languages

DOI10.1016/0304-3975(82)90089-5zbMath0504.68047OpenAlexW2001067372MaRDI QIDQ1836310

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90089-5

zbMATH Keywords

context-free languageshomomorphic imagecontext-sensitive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

On DOS languages and DOS mappings

Cites Work

• Unnamed Item
• On the emptiness of the intersection of two DOS languages problem
• On sentential forms of context-free grammars
• Pure grammars
• On basic properties of DOS systems and languages
• Some decidability problems of sentential formst †

This page was built for publication: Representation theorems using DOS languages