Maksims Dimitrijevs

Publication Activity (10 Years)

Years Active: 2015-2020
Publications (10 Years): 16

Top Topics

Regular Languages

Finite Automata

Tractable Cases

Top Venues

SOFSEM (Student Research Forum Papers / Posters)

Int. J. Found. Comput. Sci.

Publications

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)
Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. CoRR (2019)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable Realtime Probabilistic Classes. Int. J. Found. Comput. Sci. 30 (8) (2019)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Postselecting probabilistic finite state recognizers and verifiers. NCMA (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable classical and quantum complexity classes. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Postselecting probabilistic finite state recognizers and verifiers. CoRR (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Probabilistic verification of all languages. CoRR (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable realtime probabilistic classes. CoRR (2017)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable Realtime Probabilistic Classes. DCFS (2017)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable classical and quantum complexity classes. CoRR (2016)
Maksims Dimitrijevs
Capabilities of Ultrametric Automata with One, Two, and Three States. SOFSEM (2016)
Maksims Dimitrijevs, Kristine Cipola
Ultrametric Finite Automata and Their Capabilities. Balt. J. Mod. Comput. 4 (4) (2016)
Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz
Two-way frequency finite automata. NCMA (2016)
Maksims Dimitrijevs
State Complexity Advantages of Ultrametric Automata. SOFSEM (Student Research Forum Papers / Posters) (2016)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable classical and quantum complexity classes. NCMA (2016)
Maksims Dimitrijevs, Irina Scegulnaja
Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata. SOFSEM (Student Research Forum Papers / Posters) (2015)