Complexity of probabilistic versus deterministic automata (Q4560366): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:21, 7 February 2024
scientific article; zbMATH DE number 6992074
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of probabilistic versus deterministic automata |
scientific article; zbMATH DE number 6992074 |
Statements
Complexity of probabilistic versus deterministic automata (English)
0 references
11 December 2018
0 references
Turing machine
0 references
regular language
0 references
finite automaton
0 references
memory element
0 references
input word
0 references
