A subclass of deterministic context-free languages with a decidable inclusion problem (Q4007469): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the equivalence and containment problems for context-free languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Superdeterministic PDAs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5583892 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:16, 16 May 2024
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
0 references