Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
Journal of Artificial Intelligence Research
Lower bound for the length of synchronizing words in partially-synchronizing automata
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
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
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
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
Effective synchronizing algorithms
Expert Systems with Applications: An International Journal
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
Putting the turing into manufacturing: recent developments in algorithmic automation
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
This paper concerns the design of parts orienters - the dual to the motion planning problem. Two particular paradigms are considered and their abstractions to the computational domain lead to interesting problems in graph pebbling and function composition on finite sets. Polynomial time algorithms are developed for the abstracted problems.