On equivalence and subclass containment problems for deterministic context-free languages (Q1251906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On equivalence and subclass containment problems for deterministic context-free languages |
scientific article; zbMATH DE number 3609163
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On equivalence and subclass containment problems for deterministic context-free languages |
scientific article; zbMATH DE number 3609163 |
Statements
On equivalence and subclass containment problems for deterministic context-free languages (English)
0 references
1978
0 references
Languages Accepted By Realtime Pushdown Automata
0 references
Deterministic Context- Free Languages
0 references
Subclass Containment Problem
0 references
Equivalence Problem
0 references
0 references
