Peter Mlynárcik

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