"The minimal probabilistic and quantum finite automata recognizing ..."

Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz (2020)

> Home

Details and statistics

DOI: 10.23638/DMTCS-22-1-13

access: open

type: Journal Article

metadata version: 2023-01-24

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmtcs/NaumovsDY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmtcs/NaumovsDY20
Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz:
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. Discret. Math. Theor. Comput. Sci. 22(1) (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.