| Publication | Date of Publication | Type |
|---|
Some New Features and Algorithms for the Study of DFA
Open Journal of Discrete Mathematics | 2017-09-01 | Paper |
A note on a recent attempt to improve the Pin-Frankl bound
(available as arXiv preprint) | 2015-04-30 | Paper |
| A note on a recent attempt to improve the Pin-Frankl bound | 2015-04-30 | Paper |
An algorithm for road coloring
Journal of Discrete Algorithms | 2013-01-18 | Paper |
An algorithm for road coloring
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Modifying the upper bound on the length of minimal synchronizing word
Fundamentals of Computation Theory | 2011-08-19 | Paper |
A partially synchronizing coloring
Computer Science – Theory and Applications | 2010-06-22 | Paper |
The road coloring problem
Israel Journal of Mathematics | 2009-10-02 | Paper |
The Černý conjecture for aperiodic automata
(available as arXiv preprint) | 2008-05-27 | Paper |
| The Černý conjecture for aperiodic automata | 2008-05-27 | Paper |
Synchronization of Some DFA
Lecture Notes in Computer Science | 2007-11-13 | Paper |
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Notable trends concerning the synchronization of graphs and automata
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Reducing the time complexity of testing for local threshold testability
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2081053 (Why is no real title available?) | 2004-08-04 | Paper |
scientific article; zbMATH DE number 2081053 (Why is no real title available?)
(available as arXiv preprint) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1962784 (Why is no real title available?) | 2003-08-11 | Paper |
scientific article; zbMATH DE number 1962784 (Why is no real title available?)
(available as arXiv preprint) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1962781 (Why is no real title available?) | 2003-08-11 | Paper |
scientific article; zbMATH DE number 1962781 (Why is no real title available?)
(available as arXiv preprint) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1839456 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1788638 (Why is no real title available?) | 2002-08-26 | Paper |
Optimal estimation on the order of local testability of finite automata
Theoretical Computer Science | 2000-08-23 | Paper |
Identities of locally testable semigroups
Communications in Algebra | 2000-07-03 | Paper |
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
Theoretical Computer Science | 2000-06-04 | Paper |
A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
International Journal of Algebra and Computation | 1998-08-10 | Paper |
The varieties of n-testable semigroups
Semigroup Forum | 1983-01-01 | Paper |
A variety of semigroups without an irreducible basis for identities
Mathematical Notes | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3575842 (Why is no real title available?) | 1977-01-01 | Paper |
Covering elements in the lattice of varieties of algebras
Mathematical Notes | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3500061 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3311816 (Why is no real title available?) | 1970-01-01 | Paper |
