Reset sequences for monotonic automata

David Eppstein
Proc. 15th Int. Coll. Automata, Languages, and Programming (ICALP 1988), Lecture Notes in Computer Science 317, Timo Lepist� and Arto Salomaa, ed., Springer-Verlag, Jul 1988, pp. 230–238
SIAM J. Computing 19(3):500–510, Jun 1990
Mathematical Reviews 91f:68070

Cited by:

Some paradigms for the automated design of parts feeders
Stochastic Plans for Robotic Manipulation
Orienting polygonal parts without sensors
The complexity of oblivious plans for orienting and distinguishing polygonal parts
Optimal manipulation strategies for orienting planar workpieces by pushing
Principles and methods of testing finite state machines – a survey
Reset words for commutative and solvable automata
Sur les automates circulaires et la conjecture de {\v{C}}ern�
Robotic Manipulation for Parts Transfer and Orienting: Mechanics, Planning, and Shape Uncertainty
Manipulating algebraic parts in the plane
Randomized parallel algorithms for the homing sequence problem
Using partial sensor information to orient parts
Orienting polyhedral parts by pushing
Geometric Design of Part Feeders
Estimation of the length of reset words for automata with simple idempotents
Parallel algorithms for finite automata problems
Orienting micro-scale parts with squeeze and roll primitives
Aligning parts for micro assemblies
Composition sequences for functions over a finite domain
On directable nondeterministic trapped automata
Synchronization of finite automata: contributions to an old problem
Synchronizing monotonic automata
Orienting parts by inside-out pulling
A near-quadratic algorithm for fence design
Configuration Spaces in Robotic Manipulation and Motion Planning
Words guaranteeing minimal image
Synchronizing generalized monotonic automata
{\v{C}}ern�'s conjecture: retrospects and prospects
{\v{C}}ern� conjecture for DFA accepting star-free languages
Some results on {\v{C}}ern� type problems for transformation semigroups
Conformance testing in the presence of multiple faults