Peter Mlynárcik

Publication Activity (10 Years)

Years Active: 2014-2022
Publications (10 Years): 9

Top Topics

Finite Automaton

Expressive Power

Top Venues

Theor. Comput. Sci.

Publications

Michal Hospodár, Peter Mlynárcik, Viktor Olejar
Operations on Subregular Languages and Nondeterministic State Complexity. DCFS (2022)
Michal Hospodár, Peter Mlynárcik
Operations on Permutation Automata. DLT (2020)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic complexity in subclasses of convex languages. Theor. Comput. Sci. 787 (2019)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Descriptional Complexity of the Forever Operator. Int. J. Found. Comput. Sci. 30 (1) (2019)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. Adventures Between Lower Bounds and Higher Altitudes (2018)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$. DLT (2017)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic Complexity of Operations on Free and Convex Languages. CIAA (2017)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic Complexity of Operations on Closed and Ideal Languages. CIAA (2016)
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej
Prefix-free languages: Left and right quotient and reversal. Theor. Comput. Sci. 610 (2016)
Peter Mlynárcik
Complement on Free and Ideal Languages. DCFS (2015)
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej
Prefix-Free Languages: Right Quotient and Reversal. DCFS (2014)
Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej
Operations on Automata with All States Final. AFL (2014)
Galina Jirásková, Peter Mlynárcik
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. DCFS (2014)