The complexity of ranking simple languages (Q3034844)
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: Publication:3034844 |
scientific article; zbMATH DE number 4133520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of ranking simple languages |
scientific article; zbMATH DE number 4133520 |
Statements
The complexity of ranking simple languages (English)
0 references
1990
0 references
complexity of ranking
0 references
ranking languages
0 references
pushdown automata
0 references
Turing machines
0 references
finite automata
0 references
0.8525180816650391
0 references
0.8504549264907837
0 references
0.847871720790863
0 references
0.8041326403617859
0 references
0.7980325818061829
0 references
