A simplicity test for deterministic pushdown automata (Q3908478)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3718562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplicity test for deterministic pushdown automata |
scientific article; zbMATH DE number 3718562 |
Statements
A simplicity test for deterministic pushdown automata (English)
0 references
1980
0 references
real-time deterministic pushdown automata
0 references
simple deterministic pushdown automata
0 references
simple context free language
0 references
subclass containment problem
0 references
simplicity problem
0 references
