Reset Sequences for Monotonic Automata (1990) [23 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {David Eppstein},
title = {Reset Sequences for Monotonic Automata},
year = {1990}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
: 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.
Citations
| 7271 | Computers and Intractability - A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 201 | An exploration of sensorless manipulation – Erdmann, Mason - 1988 |
| 12 | An Algorithmic Approach to the Automated Design of Parts Orienters – Natarajan - 1986 |
| 3 | Parallel Computation and Conflicts – KUCERA - 1982 |
| 1 | Orienting Parts by Computer Controlled Manipulation – Grossman, Blasgen - 1975 |
