Vojtech Vorel

According to our database, Vojtech Vorel authored at least 13 papers between 2014 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Lower Bounds on Avoiding Thresholds.

Robert Ferens, Marek Szykula, Vojtech Vorel

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2019

A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink.

Dmitry S. Ananichev, Vojtech Vorel

J. Autom. Lang. Comb., 2019

2018

On Basic Properties of Jumping Finite Automata.

Vojtech Vorel

Int. J. Found. Comput. Sci., 2018

2017

Characterization and complexity results on jumping finite automata.

Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel

Theor. Comput. Sci., 2017

A Lower Bound on CNF Encodings of the At-Most-One Constraint.

Petr Kucera, Petr Savický, Vojtech Vorel

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016

Subset Synchronization and Careful Synchronization of Binary Finite Automata.

Vojtech Vorel

Int. J. Found. Comput. Sci., 2016

An Extremal Series of Eulerian Synchronizing Automata.

Marek Szykula, Vojtech Vorel

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

Two Results on Discontinuous Input Processing.

Vojtech Vorel

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

Parameterized Complexity of Synchronization and Road Coloring.

Vojtech Vorel, Adam Roman

Discret. Math. Theor. Comput. Sci., 2015

Complexity of Road Coloring with Prescribed Reset Words.

Vojtech Vorel, Adam Roman

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Detecting Short Reset Words Parameterized by Number of States.

Vojtech Vorel

CoRR, 2014

Subset Synchronization of Transitive Automata.

Vojtech Vorel

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata.

Vojtech Vorel

Proceedings of the Language and Automata Theory and Applications, 2014