On DOS languages and DOS mappings

DOI10.1007/BF02573321MaRDI QIDQ791326zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, David Haussler, Paul Zeiger, 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

algebraic characterizationAPDOSDOS languagesDOS mappingsDOS systemequivalence problemsubfamilies of context-free languages

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3902061
• Some decision problems about controlled rewriting systems
• scientific article; zbMATH DE number 3917717
• A characterisation of deterministic context-free languages by means of right-congruences
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On basic properties of DOS systems and languages
• On sentential forms of context-free grammars
• On the emptiness of the intersection of two DOS languages problem
• Pure grammars
• Representation theorems using DOS languages
• Some decidability problems of sentential formst †

Cited in

(1)

• scientific article; zbMATH DE number 3902061 (Why is no real title available?)

This page was built for publication: On DOS languages and DOS mappings

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