On DOS languages and DOS mappings

DOI10.1007/BF02573321zbMath0535.68034OpenAlexW1969091720MaRDI QIDQ791326

Paul Zeiger, Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg

Publication date: 1984

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134678

zbMATH Keywords

equivalence problemalgebraic characterizationAPDOSDOS languagesDOS mappingsDOS systemsubfamilies of context-free languages

Mathematics Subject Classification ID

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

Related Items

Unnamed Item

Cites Work

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