Peter Mlynárčik

Available identifiers

zbMath Open mlynarcik.peterMaRDI QIDQ2112185

List of research outcomes

Publication	Date of Publication	Type
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity	2023-06-30	Paper
Operations on subregular languages and nondeterministic state complexity	2023-01-18	Paper
Operations on Permutation Automata	2022-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q4994945	2021-06-22	Paper
Nondeterministic complexity in subclasses of convex languages	2019-08-20	Paper
Descriptional Complexity of the Forever Operator	2019-06-24	Paper
On the descriptive complexity of \(\overline{\varSigma ^*\overline{L}}\)	2017-10-13	Paper
Nondeterministic complexity of operations on free and convex languages	2017-08-22	Paper
Nondeterministic Complexity of Operations on Closed and Ideal Languages	2016-11-09	Paper
Complement on Free and Ideal Languages	2015-08-07	Paper
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages	2014-08-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Peter Mlynárčik