Vojtech Vorel

Publication Activity (10 Years)

Years Active: 2014-2021
Publications (10 Years): 14

Top Topics

Finite Automata

Top Venues

J. Autom. Lang. Comb.

Theor. Comput. Sci.

Publications

Robert Ferens, Marek Szykula, Vojtech Vorel
Lower Bounds on Avoiding Thresholds. MFCS (2021)
Vojtech Vorel, Adam Roman
Complexity of road coloring with prescribed reset words. J. Comput. Syst. Sci. 104 (2019)
Petr Kucera, Petr Savický, Vojtech Vorel
A lower bound on CNF encodings of the at-most-one constraint. Theor. Comput. Sci. 762 (2019)
Dmitry S. Ananichev, Vojtech Vorel
A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink. J. Autom. Lang. Comb. 24 (2-4) (2019)
Vojtech Vorel
On Basic Properties of Jumping Finite Automata. Int. J. Found. Comput. Sci. 29 (1) (2018)
Petr Kucera, Petr Savický, Vojtech Vorel
A lower bound on CNF encodings of the at-most-one constraint. CoRR (2017)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679 (2017)
Vojtech Vorel
Complexity of a problem concerning reset words for Eulerian binary automata. Inf. Comput. 253 (2017)
Vojtech Vorel
Two Results on Discontinuous Input Processing. J. Autom. Lang. Comb. 22 (1-3) (2017)
Petr Kucera, Petr Savický, Vojtech Vorel
A Lower Bound on CNF Encodings of the At-Most-One Constraint. SAT (2017)
Vojtech Vorel
Two Results on Discontinuous Input Processing. DCFS (2016)
Marek Szykula, Vojtech Vorel
An Extremal Series of Eulerian Synchronizing Automata. DLT (2016)
Vojtech Vorel, Marek Szykula
An Extremal Series of Eulerian Synchronizing Automata. CoRR (2016)
Vojtech Vorel
Subset Synchronization and Careful Synchronization of Binary Finite Automata. Int. J. Found. Comput. Sci. 27 (5) (2016)
Vojtech Vorel
Two Results on Discontinuous Input Processing. CoRR (2015)
Vojtech Vorel, Adam Roman
Complexity of Road Coloring with Prescribed Reset Words. LATA (2015)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
Characterization and Complexity Results on Jumping Finite Automata. CoRR (2015)
Vojtech Vorel, Adam Roman
Parameterized Complexity of Synchronization and Road Coloring. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Vojtech Vorel
On Basic Properties of Jumping Finite Automata. CoRR (2015)
Vojtech Vorel
Detecting Short Reset Words Parameterized by Number of States. CoRR (2014)
Vojtech Vorel
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata. LATA (2014)
Vojtech Vorel
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata. CoRR (2014)
Vojtech Vorel
Subset Synchronization of Transitive Automata. AFL (2014)
Vojtech Vorel, Adam Roman
Complexity of Road Coloring with Prescribed Reset Words. CoRR (2014)