Marek Szykuła

Available identifiers

zbMath Open szykula.marekMaRDI QIDQ722209

List of research outcomes

Publication	Date of Publication	Type
Completely reachable automata: a polynomial algorithm and quadratic upper bounds	2024-11-14	Paper
Reset thresholds of transformation monoids	2024-05-30	Paper
Lower Bounds on Avoiding Thresholds	2023-08-08	Paper
Existential length universality	2023-02-07	Paper
The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words	2022-12-08	Paper
Complexity of Preimage Problems for Deterministic Finite Automata	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5005121	2021-08-04	Paper
State Complexity of Overlap Assembly	2021-04-19	Paper
Synchronizing Strongly Connected Partial DFAs	2021-01-13	Paper
Preimage problems for deterministic finite automata	2020-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q3304155	2020-08-05	Paper
Attainable Values of Reset Thresholds	2020-05-26	Paper
Algebraic synchronization criterion and computing reset words	2020-01-06	Paper
Syntactic complexity of bifix-free regular languages	2019-08-20	Paper
Complexity of bifix-free regular languages	2019-08-20	Paper
State complexity of overlap assembly	2018-11-07	Paper
Syntactic complexity of regular ideals	2018-07-23	Paper
Syntactic complexity of suffix-free languages	2018-03-21	Paper
Complexity of suffix-free regular languages	2017-09-07	Paper
Syntactic complexity of bifix-free languages	2017-08-22	Paper
Complexity of bifix-free regular languages	2017-08-22	Paper
On the State Complexity of the Shuffle of Regular Languages	2016-11-09	Paper
Experiments with Synchronizing Automata	2016-11-09	Paper
An Extremal Series of Eulerian Synchronizing Automata	2016-08-30	Paper
Large Aperiodic Semigroups	2016-02-17	Paper
Complexity of Suffix-Free Regular Languages	2015-09-29	Paper
On the Number of Synchronizing Colorings of Digraphs	2015-09-23	Paper
Checking Whether an Automaton Is Monotonic Is NP-complete	2015-09-23	Paper
Synchronizing Automata with Extremal Properties	2015-09-16	Paper
Algebraic synchronization criterion and computing reset words	2015-09-16	Paper
Upper Bound on Syntactic Complexity of Suffix-Free Languages	2015-08-07	Paper
Computing the shortest reset words of synchronizing automata	2015-07-10	Paper
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals	2014-10-14	Paper
Large Aperiodic Semigroups	2014-09-26	Paper
Generating Small Automata and the Černý Conjecture	2013-08-07	Paper
A Fast Algorithm Finding the Shortest Reset Words	2013-06-11	Paper
Rainbow induced subgraphs in proper vertex colorings	2012-03-22	Paper
Rainbow Induced Subgraphs in Replication Graphs	2012-01-25	Paper

Research outcomes over time

This page was built for person: Marek Szykuła