Reset sequences for finite automata with application to design of parts orienters
Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists. In this paper we present a new algorithm based on breadth first search that runs in faster asymptotic time than Natarajan's algorithms, and in addition finds the shortest possible reset sequence if such a sequence exists. We give tight bounds on the length of the minimum reset sequence. We further improve the time and space bounds of another algorithm given by Natarajan, which finds reset sequences for arbitrary deterministic finite automata when all states are initially possible.
KeywordsTransition Function Input Sequence Cyclic Order Input Symbol Satisfying Assignment
Unable to display preview. Download preview PDF.
- M.R. Garey and D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.Google Scholar
- D.D. Grossman and M.W. Blasgen, Orienting Parts by Computer Controlled Manipulation, IEEE Trans. Systems, Man and Cybernetics 5(5), 1975, pp. 561–565.Google Scholar
- L. Kučera, Parallel Computation and Conflicts in Memory Access, Info. Proc. Letters 14(2), April 1982, pp. 93–96.Google Scholar
- M.T. Mason and M. Erdmann, An Exploration of Sensorless Manipulation, 3rd IEEE Intl. Conf. Robotics and Automation, San Francisco, April 1986.Google Scholar
- B.K. Natarajan, An Algorithmic Approach to the Automated Design of Parts Orienters, Proc. 27th Annual Symp. Foundations of Computer Science, IEEE, 1986, pp. 132–142.Google Scholar