New families of non real time dpda's and their decidability results (Q799385)
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: New families of non real time dpda's and their decidability results |
scientific article; zbMATH DE number 3874646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New families of non real time dpda's and their decidability results |
scientific article; zbMATH DE number 3874646 |
Statements
New families of non real time dpda's and their decidability results (English)
0 references
1984
0 references
equivalence problem
0 references
subclass containment problems
0 references
deterministic pushdown automata
0 references
on-line regularity indication
0 references
linearity test
0 references
polynomial time algorithms
0 references
real time strictness
0 references
0 references
0 references
0.78440922498703
0 references
0.7679840326309204
0 references
0.7654253840446472
0 references
0.7615751028060913
0 references
