A subclass of deterministic context-free languages with a decidable inclusion problem (Q4007469)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subclass of deterministic context-free languages with a decidable inclusion problem |
scientific article |
Statements
A subclass of deterministic context-free languages with a decidable inclusion problem (English)
0 references
27 September 1992
0 references
deterministic comtext-free languages
0 references
finite automata
0 references
direct product
0 references
free semigroups
0 references
decidability
0 references
