Marek Szykula

According to our database1, Marek Szykula authored at least 53 papers between 2011 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Preimage problems for deterministic finite automata.
J. Comput. Syst. Sci., 2021

The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words.
J. ACM, 2021

Split Moves for Monte-Carlo Tree Search.
CoRR, 2021

Synchronizing Strongly Connected Partial DFAs.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Lower Bounds on Avoiding Thresholds.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
State Complexity of Overlap Assembly.
Int. J. Found. Comput. Sci., 2020

Experimental Studies in General Game Playing: An Experience Report.
CoRR, 2020

Existential Length Universality.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Efficient Reasoning in Regular Boardgames.
Proceedings of the IEEE Conference on Games, 2020

2019
Syntactic complexity of bifix-free regular languages.
Theor. Comput. Sci., 2019

Complexity of bifix-free regular languages.
Theor. Comput. Sci., 2019

A note on the empirical comparison of RBG and Ludii.
CoRR, 2019

Complexity of the Frobenius monoid problem for a finite language.
CoRR, 2019

Regular Boardgames.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Syntactic Complexity of Regular Ideals.
Theory Comput. Syst., 2018

Syntactic complexity of suffix-free languages.
Inf. Comput., 2018

A machine learning approach to synchronization of automata.
Expert Syst. Appl., 2018

Improving the Upper Bound on the Length of the Shortest Reset Word.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Finding Short Synchronizing Words for Prefix Codes.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Complexity of Preimage Problems for Deterministic Finite Automata.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Complexity of suffix-free regular languages.
J. Comput. Syst. Sci., 2017

Improving the upper bound the length of the shortest reset words.
CoRR, 2017

Regular Boardgames.
CoRR, 2017

Existential length universality.
CoRR, 2017

Complexity of regular bifix-free languages.
CoRR, 2017

Extending word problems in deterministic finite automata.
CoRR, 2017

Syntactic Complexity of Bifix-Free Languages.
Proceedings of the Implementation and Application of Automata, 2017

Attainable Values of Reset Thresholds.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Algebraic synchronization criterion and computing reset words.
Inf. Sci., 2016

Simplified Boardgames.
CoRR, 2016

Experiments with Synchronizing Automata.
Proceedings of the Implementation and Application of Automata, 2016

Evolving Chess-like Games Using Relative Algorithm Performance Profiles.
Proceedings of the Applications of Evolutionary Computation - 19th European Conference, 2016

An Extremal Series of Eulerian Synchronizing Automata.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

On the State Complexity of the Shuffle of Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
Computing the shortest reset words of synchronizing automata.
J. Comb. Optim., 2015

Large Aperiodic Semigroups.
Int. J. Found. Comput. Sci., 2015

Forward and backward synchronizing algorithms.
Expert Syst. Appl., 2015

Procedural Content Generation for GDL Descriptions of Simplified Boardgames.
CoRR, 2015

Checking Whether an Automaton Is Monotonic Is NP-complete.
Proceedings of the Implementation and Application of Automata, 2015

On the Number of Synchronizing Colorings of Digraphs.
Proceedings of the Implementation and Application of Automata, 2015

Synchronizing Automata with Extremal Properties.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Upper Bound on Syntactic Complexity of Suffix-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
Checking if an Automaton is Monotonic is NP-complete.
CoRR, 2014

Synchronizing Automata with Large Reset Lengths.
CoRR, 2014

Computing Reset Words for Prefix Codes and Various Classes of Synchronizing Automata.
CoRR, 2014

Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
The Černý conjecture for small automata: experimental report
CoRR, 2013

A New Heuristic Synchronizing Algorithm.
CoRR, 2013

Generating Small Automata and the Černý Conjecture.
Proceedings of the Implementation and Application of Automata, 2013

A Fast Algorithm Finding the Shortest Reset Words.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Game Description Language Compiler Construction.
Proceedings of the AI 2013: Advances in Artificial Intelligence, 2013

2012
Rainbow Induced Subgraphs in Replication Graphs
CoRR, 2012

2011
Rainbow Induced Subgraphs in Proper Vertex Colorings.
Fundam. Informaticae, 2011


  Loading...