Marek Szykula

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 53

Top Topics

Finite Automata

Regular Languages

Top Venues

Publications

Michal Maras, Michal Kepa, Jakub Kowalski, Marek Szykula
Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract). AAAI (2024)
Robert Ferens, Marek Szykula
Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds. ICALP (2023)
Igor Rystsov, Marek Szykula
Primitive Automata that are Synchronizing. CoRR (2023)
Igor Rystsov, Marek Szykula
Reset thresholds of transformation monoids. CoRR (2023)
Michal Maras, Michal Kepa, Jakub Kowalski, Marek Szykula
Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract). CoRR (2023)
Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Mark H. M. Winands
Split Moves for Monte-Carlo Tree Search. AAAI (2022)
Marek Szykula, Adam Zyzik
An Improved Algorithm for Finding the Shortest Synchronizing Words. CoRR (2022)
Marek Szykula, Adam Zyzik
An Improved Algorithm for Finding the Shortest Synchronizing Words. ESA (2022)
Robert Ferens, Marek Szykula
Completely Reachable Automata: A Polynomial Solution and Quadratic Bounds for the Subset Reachability Problem. CoRR (2022)
Maksymilian Mika, Marek Szykula
The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words. J. ACM 68 (3) (2021)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Preimage problems for deterministic finite automata. J. Comput. Syst. Sci. 115 (2021)
Robert Ferens, Marek Szykula, Vojtech Vorel
Lower Bounds on Avoiding Thresholds. MFCS (2021)
Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula
Synchronizing Strongly Connected Partial DFAs. STACS (2021)
Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Mark H. M. Winands
Split Moves for Monte-Carlo Tree Search. CoRR (2021)
Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula
Synchronizing Strongly Connected Partial DFAs. CoRR (2021)
Jakub Kowalski, Marek Szykula
Experimental Studies in General Game Playing: An Experience Report. CoRR (2020)
Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
Existential Length Universality. STACS (2020)
Jakub Kowalski, Radoslaw Miernik, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Andrzej Tkaczyk
Efficient Reasoning in Regular Boardgames. CoRR (2020)
Jakub Kowalski, Radoslaw Miernik, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Andrzej Tkaczyk
Efficient Reasoning in Regular Boardgames. CoG (2020)
Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula
State Complexity of Overlap Assembly. Int. J. Found. Comput. Sci. 31 (8) (2020)
Jakub Kowalski, Maksymilian Mika, Jakub Sutowicz, Marek Szykula
Regular Boardgames. AAAI (2019)
Marek Szykula, John Wittnebel
Syntactic complexity of bifix-free regular languages. Theor. Comput. Sci. 787 (2019)
Jakub Kowalski, Maksymilian Mika, Jakub Sutowicz, Marek Szykula
A note on the empirical comparison of RBG and Ludii. CoRR (2019)
Robert Ferens, Marek Szykula
Complexity of bifix-free regular languages. Theor. Comput. Sci. 787 (2019)
Maksymilian Mika, Marek Szykula
Complexity of the Frobenius monoid problem for a finite language. CoRR (2019)
Marek Szykula
Improving the Upper Bound on the Length of the Shortest Reset Word. STACS (2018)
Andrew Ryzhikov, Marek Szykula
Finding Short Synchronizing Words for Prefix Codes. CoRR (2018)
Janusz A. Brzozowski, Marek Szykula
Syntactic complexity of suffix-free languages. Inf. Comput. 259 (2) (2018)
Janusz A. Brzozowski, Marek Szykula, Yuli Ye
Syntactic Complexity of Regular Ideals. Theory Comput. Syst. 62 (5) (2018)
Igor T. Podolak, Adam Roman, Marek Szykula, Bartosz Zielinski
A machine learning approach to synchronization of automata. Expert Syst. Appl. 97 (2018)
Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula
State Complexity of Overlap Assembly. CIAA (2018)
Andrew Ryzhikov, Marek Szykula
Finding Short Synchronizing Words for Prefix Codes. MFCS (2018)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Complexity of Preimage Problems for Deterministic Finite Automata. MFCS (2018)
Michalina Dzyga, Robert Ferens, Vladimir V. Gusev, Marek Szykula
Attainable Values of Reset Thresholds. MFCS (2017)
Marek Szykula
Improving the upper bound the length of the shortest reset words. CoRR (2017)
Marek Szykula, John Wittnebel
Syntactic Complexity of Bifix-Free Languages. CIAA (2017)
Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula
State Complexity of Overlap Assembly. CoRR (2017)
Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
Existential length universality. CoRR (2017)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Extending word problems in deterministic finite automata. CoRR (2017)
Jakub Kowalski, Jakub Sutowicz, Marek Szykula
Regular Boardgames. CoRR (2017)
Janusz A. Brzozowski, Marek Szykula
Complexity of suffix-free regular languages. J. Comput. Syst. Sci. 89 (2017)
Robert Ferens, Marek Szykula
Complexity of regular bifix-free languages. CoRR (2017)
Robert Ferens, Marek Szykula
Complexity of Bifix-Free Regular Languages. CIAA (2017)
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula
Experiments with Synchronizing Automata. CIAA (2016)
Mikhail V. Berlinkov, Marek Szykula
Algebraic synchronization criterion and computing reset words. Inf. Sci. 369 (2016)
Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula
On the State Complexity of the Shuffle of Regular Languages. DCFS (2016)
Jakub Kowalski, Jakub Sutowicz, Marek Szykula
Simplified Boardgames. CoRR (2016)
Marek Szykula, Vojtech Vorel
An Extremal Series of Eulerian Synchronizing Automata. DLT (2016)
Jakub Kowalski, Marek Szykula
Evolving Chess-like Games Using Relative Algorithm Performance Profiles. EvoApplications (1) (2016)
Marek Szykula, John Wittnebel
Syntactic complexity of bifix-free languages. CoRR (2016)
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula
Experiments with Synchronizing Automata. CoRR (2016)
Vojtech Vorel, Marek Szykula
An Extremal Series of Eulerian Synchronizing Automata. CoRR (2016)
Andrzej Kisielewicz, Marek Szykula
Synchronizing Automata with Extremal Properties. CoRR (2016)
Jakub Kowalski, Marek Szykula
Procedural Content Generation for GDL Descriptions of Simplified Boardgames. CoRR (2015)
Andrzej Kisielewicz, Marek Szykula
Synchronizing Automata with Extremal Properties. MFCS (1) (2015)
Janusz A. Brzozowski, Marek Szykula
Large Aperiodic Semigroups. Int. J. Found. Comput. Sci. 26 (7) (2015)
Janusz A. Brzozowski, Marek Szykula
Upper Bound on Syntactic Complexity of Suffix-Free Languages. DCFS (2015)
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula
Computing the shortest reset words of synchronizing automata. J. Comb. Optim. 29 (1) (2015)
Mikhail V. Berlinkov, Marek Szykula
Algebraic Synchronization Criterion and Computing Reset Words. MFCS (1) (2015)
Janusz A. Brzozowski, Marek Szykula, Yuli Ye
Syntactic Complexity of Regular Ideals. CoRR (2015)
Marek Szykula
Checking Whether an Automaton Is Monotonic Is NP-complete. CIAA (2015)
Janusz A. Brzozowski, Marek Szykula
Complexity of Suffix-Free Regular Languages. FCT (2015)
Vladimir V. Gusev, Marek Szykula
On the Number of Synchronizing Colorings of Digraphs. CIAA (2015)
Janusz A. Brzozowski, Marek Szykula
Complexity of Suffix-Free Regular Languages. CoRR (2015)
Adam Roman, Marek Szykula
Forward and backward synchronizing algorithms. Expert Syst. Appl. 42 (24) (2015)
Vladimir V. Gusev, Marek Szykula
On the Number of Synchronizing Colorings of Digraphs. CoRR (2015)
Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula
On the State Complexity of the Shuffle of Regular Languages. CoRR (2015)
Mikhail V. Berlinkov, Marek Szykula
Computing Reset Words for Prefix Codes and Various Classes of Synchronizing Automata. CoRR (2014)
Janusz A. Brzozowski, Marek Szykula
Large Aperiodic Semigroups. CIAA (2014)
Andrzej Kisielewicz, Marek Szykula
Synchronizing Automata with Large Reset Lengths. CoRR (2014)
Janusz A. Brzozowski, Marek Szykula
Upper Bound on Syntactic Complexity of Suffix-Free Languages. CoRR (2014)
Marek Szykula
Checking if an Automaton is Monotonic is NP-complete. CoRR (2014)
Janusz A. Brzozowski, Marek Szykula
Large Aperiodic Semigroups. CoRR (2014)
Janusz A. Brzozowski, Marek Szykula
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. CoRR (2014)
Janusz A. Brzozowski, Marek Szykula
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. Developments in Language Theory (2014)
Andrzej Kisielewicz, Marek Szykula
Generating Small Automata and the Černý Conjecture. CIAA (2013)
Jakub Kowalski, Marek Szykula
Game Description Language Compiler Construction. Australasian Conference on Artificial Intelligence (2013)
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula
A Fast Algorithm Finding the Shortest Reset Words. COCOON (2013)
Jakub Kowalski, Marek Szykula
A New Heuristic Synchronizing Algorithm. CoRR (2013)
Jakub Kowalski, Marek Szykula
The Černý conjecture for small automata: experimental report CoRR (2013)
Marek Szykula, Andrzej Kisielewicz
Rainbow Induced Subgraphs in Replication Graphs CoRR (2012)
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula
Fast algorithm finding the shortest reset words CoRR (2012)
Andrzej Kisielewicz, Marek Szykula
Rainbow Induced Subgraphs in Proper Vertex Colorings. Fundam. Informaticae 111 (4) (2011)