A subclass of deterministic context-free languages with a decidable inclusion problem
From MaRDI portal
Publication:4007469
DOI10.1007/BF01068604zbMath0800.68530MaRDI QIDQ4007469
A. B. Stavrovskij, P. V. Gorshkov
Publication date: 27 September 1992
Published in: Cybernetics (Search for Journal in Brave)
free semigroups; decidability; finite automata; direct product; deterministic comtext-free languages
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Cites Work