One alternation can be more powerful than randomization in small and fast two-way finite automata (Q2842771)
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 6199048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One alternation can be more powerful than randomization in small and fast two-way finite automata |
scientific article; zbMATH DE number 6199048 |
Statements
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata (English)
0 references
16 August 2013
0 references
0.8388240933418274
0 references
0.7998589873313904
0 references
0.7998589873313904
0 references
