Maksims Dimitrijevs

According to our database, Maksims Dimitrijevs authored at least 10 papers between 2015 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints.

Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz

Discret. Math. Theor. Comput. Sci., 2020

2019

Uncountable Realtime Probabilistic Classes.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2019

2018

Uncountable classical and quantum complexity classes.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

RAIRO Theor. Informatics Appl., 2018

Probabilistic verification of all languages.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

CoRR, 2018

Postselecting probabilistic finite state recognizers and verifiers.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

2016

Ultrametric Finite Automata and Their Capabilities.

Maksims Dimitrijevs, Kristine Cipola

Balt. J. Mod. Comput., 2016

State Complexity Advantages of Ultrametric Automata.

Maksims Dimitrijevs

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016 co-located with 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 2016

Capabilities of Ultrametric Automata with One, Two, and Three States.

Maksims Dimitrijevs

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Two-way frequency finite automata.

Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015

Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata.

Maksims Dimitrijevs, Irina Scegulnaja

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015