# Search results for: Andrzej Kisielewicz

Journal of Graph Theory > 101 > 1 > 29 - 51

Graphs and Combinatorics > 2019 > 35 > 6 > 1405-1432

Electronic Notes in Discrete Mathematics > 2018 > 68 > C > 83-88

Electronic Notes in Discrete Mathematics > 2018 > 68 > C > 41-46

Studia Philosophica Wratislaviensia > 2018 > 13 > 3 > 43-48

Studia Philosophica Wratislaviensia > 2018 > 13 > 3 > 137-170

Electronic Notes in Discrete Mathematics > 2016 > 54 > C > 115-120

Theoretical Computer Science > 2016 > 629 > C > 64-79

Lecture Notes in Computer Science > Language and Automata Theory and Applications > Contributed Papers > 221-231

*w*over an alphabet

*Σ*is

*n*-synchronizing if it resets every (

*n*+ 1)-state synchronizing automaton over this alphabet. For a fixed

*n*and

*Σ*,

*n*-synchronizing words can be recognized in polynomial time, yet no practical algorithm is known. In this paper we show that one cannot expect to find such an algorithm. We prove that the problem of recognizing 2-synchronizing words, where the input consists...

Lecture Notes in Computer Science > Graph Drawing > 277-286

2015 IEEE Congress on Evolutionary Computation (CEC) > 1466 - 1473

Journal of Combinatorial Optimization > 2015 > 29 > 1 > 88-124

European Journal of Combinatorics > 2014 > 40 > Complete > 1-10

Argumentation > 2014 > 28 > 3 > 267-282

Theoretical Computer Science > 2010 > 411 > 7-9 > 1115-1120

Discrete Mathematics > 2008 > 308 > 7 > 1142-1152

Journal of Pure and Applied Algebra > 2006 > 206 > 3 > 355-369

Journal of Algebra > 2004 > 279 > 1 > 280-291

Discrete Mathematics > 2004 > 283 > 1-3 > 81-86

Journal of Algebra > 2003 > 267 > 2 > 587-607