A subclass of deterministic context-free languages with a decidable inclusion problem

DOI10.1007/BF01068604MaRDI QIDQ4007469zbMATH OpenFDO

Authors P. V. Gorshkov, A. B. Stavrovskij

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068604

zbMATH Keywords

decidabilitydeterministic comtext-free languagesdirect productfinite automatafree semigroups

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites work

• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• scientific article; zbMATH DE number 3302325 (Why is no real title available?)
• On the equivalence and containment problems for context-free languages
• Superdeterministic PDAs

This page was built for publication: A subclass of deterministic context-free languages with a decidable inclusion problem

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