Publications
- Parameterized Complexity of Synchronization and Road Coloring2015 | Faculty of Mathematics and Physics
- A lower bound on CNF encodings of the at-most-one constraint2019 | Faculty of Mathematics and Physics
- On Basic Properties of Jumping Finite Automata2018 | Faculty of Mathematics and Physics
- Characterization and complexity results on jumping finite automata2017 | Faculty of Mathematics and Physics
- A Lower Bound on CNF Encodings of the At-Most-One Constraint2017 | Faculty of Mathematics and Physics
- Subset Synchronization and Careful Synchronization of Binary Finite Automata2016 | Faculty of Mathematics and Physics
- Two Results on Discontinuous Input Processing +12016 | Faculty of Mathematics and Physics
- An Extremal Series of Eulerian Synchronizing Automata2016 | Faculty of Mathematics and Physics
- Complexity of Road Coloring with Prescribed Reset Words +12015 | Faculty of Mathematics and Physics
- Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata +12014 | Faculty of Mathematics and Physics
Loading network view...