The complexity of probabilistic versus deterministic finite automata (Q6487443)
From MaRDI portal
scientific article; zbMATH DE number 7645887
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of probabilistic versus deterministic finite automata |
scientific article; zbMATH DE number 7645887 |
Statements
The complexity of probabilistic versus deterministic finite automata (English)
0 references
25 January 2023
0 references
