The complexity of probabilistic versus deterministic finite automata (Q6487443)
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: The complexity of probabilistic versus deterministic finite automata |
scientific article; zbMATH DE number 7645887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9203646
0 references
0 references
0 references
0.9100427
0 references
