On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714)
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 the Descriptional Complexity of the Window Size for Deterministic Restarting Automata |
scientific article; zbMATH DE number 6084464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata |
scientific article; zbMATH DE number 6084464 |
Statements
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (English)
0 references
20 September 2012
0 references
restarting automaton
0 references
window size
0 references
descriptional complexity
0 references
non-recursive trade-off
0 references
0.9607247
0 references
0.91740656
0 references
0.91361773
0 references
0.91256815
0 references
0.9052791
0 references
0.88981897
0 references
0.8860155
0 references
0.88354534
0 references
0.8629508
0 references
