The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints.
| Autor: | Naumovs, Aleksejs1, Dimitrijevs, Maksims2, Yakaryılmaz, Abuzer2 |
|---|---|
| Zdroj: | Discrete Mathematics & Theoretical Computer Science (DMTCS). 2020, Vol. 22 Issue 1, p1-12. 12p. |
| Databáze: | Academic Search Ultimate |
| Externí odkaz: |
|