pl. Uniwersytecki
Zainteresowania
- state complexity
- reset word
- finite automata
- synchronizing word
- synchronizing automaton
- upper bounds
- reset threshold
- černý conjecture
- dfa
- avoiding word
Dyscyplina naukowa
- informatyka
Najnowsze publikacje
- All-instances oblivious chase termination is undecidable for single-head binary TGDs
- Completely reachable automata: a polynomial algorithm and quadratic upper bounds
- Synchronizing strongly connected partial DFAs
- Attainable values of reset thresholds
- Solving one variable word equations in the free group in cubic time
- Lower bounds on avoiding thresholds
- Complexity of preimage problems for deterministic finite automata
- Preimage problems for deterministic finite automata
- Complexity of bifix-free regular languages
- Complexity of bifix-free regular languages
