Reset sequences for monotonic automata
SIAM Journal on Computing
Journal of the ACM (JACM)
On the state complexity of reversals of regular languages
Theoretical Computer Science
Synchronizing generalized monotonic automata
Theoretical Computer Science - Insightful theory
Synchronizing automata with a letter of deficiency 2
Theoretical Computer Science
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
On the Computational Complexity of Monotone Constraint Satisfaction Problems
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Synchronizing automata preserving a chain of partial orders
Theoretical Computer Science
Synchronizing automata preserving a chain of partial orders
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
The averaging trick and the Černý conjecture
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Syntactic complexity of ideal and closed languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Complexity of problems concerning reset words for cyclic and Eulerian automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
State complexity and the monoid of transformations of a finite set
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Approximating the minimum length of synchronizing words is hard
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Synchronizing automata with a letter of deficiency 2
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Composition sequences and synchronizing automata
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Complexity of problems concerning reset words for cyclic and Eulerian automata
Theoretical Computer Science
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Approximating the Minimum Length of Synchronizing Words Is Hard
Theory of Computing Systems
| Hi-index | 5.23 |
Diverse problems ranging from many-valued logics to finite automata can be expressed as questions concerning compositions of functions over a finite domain. We develop a theory dealing with the depth and complete depth of such functions. Interconnections with synchronizable finite automata are also discussed. Many of the very basic problems turn out to be NP-hard. Also several open problems are pointed out.