Peter Mlynárcik

According to our database, Peter Mlynárcik authored at least 13 papers between 2014 and 2022.

Collaborative distances:

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

2022

Operations on Subregular Languages and Nondeterministic State Complexity.

Michal Hospodár, Peter Mlynárcik, Viktor Olejár

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2020

Operations on Permutation Automata.

Michal Hospodár, Peter Mlynárcik

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

Nondeterministic complexity in subclasses of convex languages.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Theor. Comput. Sci., 2019

Descriptional Complexity of the Forever Operator.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

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

2018

A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Nondeterministic Complexity of Operations on Free and Convex Languages.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Implementation and Application of Automata, 2017

On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Prefix-free languages: Left and right quotient and reversal.

Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej

Theor. Comput. Sci., 2016

Nondeterministic Complexity of Operations on Closed and Ideal Languages.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Implementation and Application of Automata, 2016

2015

Complement on Free and Ideal Languages.

Peter Mlynárcik

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

Operations on Automata with All States Final.

Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages.

Galina Jirásková, Peter Mlynárcik

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Prefix-Free Languages: Right Quotient and Reversal.

Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2014