The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints (Q5130748)
From MaRDI portal
scientific article; zbMATH DE number 7268112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints |
scientific article; zbMATH DE number 7268112 |
Statements
28 October 2020
0 references
probabilistic automaton
0 references
quantum automaton
0 references
uncountable languages
0 references
recognition with cutpoint
0 references
unary languages
0 references
0 references
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints (English)
0 references
