Orienting polyhedral parts by pushing
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
Composition sequences for functions over a finite domain
Theoretical Computer Science
Synchronization of finite automata: contributions to an old problem
The essence of computation
On directable nondeterministic trapped automata
Acta Cybernetica
Synchronizing monotonic automata
Theoretical Computer Science - Developments in language theory
Synchronizing generalized monotonic automata
Theoretical Computer Science - Insightful theory
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Synchronizing automata with a letter of deficiency 2
Theoretical Computer Science
Discrete Applied Mathematics
A series of slowly synchronizing automata with a zero state over a small alphabet
Information and Computation
Information and Computation
Shortest Synchronizing Strings for Huffman Codes
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
Genetic Algorithm for Synchronization
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Shortest synchronizing strings for Huffman codes
Theoretical Computer Science
Synchronizing automata preserving a chain of partial orders
Theoretical Computer Science
A note on Černy conjecture for automata over 3-letter alphabet
Journal of Automata, Languages and Combinatorics
Synchronizing monotonic automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Synchronizing automata preserving a chain of partial orders
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Decision version of the road coloring problem is NP-complete
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On a conjecture by Carpi and D'Alessandro
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Slowly synchronizing automata and digraphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The complexity of finding reset words in finite automata
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The NP-completeness of the Road Coloring Problem
Information Processing Letters
COMPAS: a computing package for synchronization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Approximating minimum reset sequences
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
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
Experimental study of the shortest reset word of random automat
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Lower bounds for the length of reset words in Eulerian automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Synchronizing sequences on not strongly connected Petri nets (Work-in-Progress)
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Conditions for avoiding controllability problems in distributed testing
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
The mortality threshold for partially monotonic automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximating the minimum length of synchronizing words is hard
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA
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
P---NP threshold for synchronizing road coloring
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Effective synchronizing algorithms
Expert Systems with Applications: An International Journal
Complexity of problems concerning reset words for cyclic and Eulerian automata
Theoretical Computer Science
The Synchronizing Probability Function of an Automaton
SIAM Journal on Discrete Mathematics
Application of hierarchical classifier to minimal synchronizing word problem
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Synchronization of automata with one undefined or ambiguous transition
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Putting the turing into manufacturing: recent developments in algorithmic automation
Proceedings of the twenty-ninth annual symposium on Computational geometry
Groups synchronizing a transformation of non-uniform kernel
Theoretical Computer Science
Generating small automata and the Černý conjecture
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Approximating the Minimum Length of Synchronizing Words Is Hard
Theory of Computing Systems
| Hi-index | 0.01 |