See this document in CiteSeerX!

Reset Sequences for Monotonic Automata (1990)  (Make Corrections)  (11 citations)
David Eppstein
SIAM J. Comput.



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
uci.edu/~eppstein/pubs...EppSJC90.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uci.edu/~eppstein/pubs/all (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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. ... (Update)

Context of citations to this paper:   More

...is another problem for which parallel algorithms are hard to construct. In a subclass of automata known as monotonic automata, Eppstein [9] presented an NC algorithm that actually finds the shortest synchronizing sequence. Eppstein also presented an RNC algorithm for the...

.... a synchronizing sequence is fundamental in automata theory, with applications in hardware testing [RHO] and mechanical parts orientation [EPP], among others. A string x is said to be a synchronizing sequence for a determininstic nite automaton M if the state reached after...

Cited by:   More
Manipulating Algebraic Parts in the Plane - Rao, Goldberg (1993)   (Correct)
Words Guaranteeing Minimal Image - Volkov   (Correct)
Orienting Polygonal Parts without Sensors - Goldberg (1992)   (Correct)

Active bibliography (related documents):   More   All
0.1:   An Exploration of Nonprehensile Two-Palm Manipulation: Planning.. - Erdmann (1995)   (Correct)
0.1:   Computing Fence Designs for Orienting Parts - Berretty, Goldberg, Overmars.. (1998)   (Correct)
0.1:   Geometric Algorithms for Trap Design - Berretty, Goldberg, Overmars, van.. (1998)   (Correct)

Similar documents based on text:   More   All
0.1:   A Theory of Unsupervised Speedup Learning - Tadepalli (1992)   (Correct)
0.1:   A lower bound for families of Natarajan dimension d - Fischer, Matousek   (Correct)
0.1:   A Formal Framework for Speedup Learning from Problems and.. - Tadepalli, al. (1996)   (Correct)

Related documents from co-citation:   More   All
6:   Planning Robotic Manipulation Strategies for Workpieces That Slide (context) - Peshkin, Sanderson - 1988
5:   Planning sequences of squeeze-grasps to orient and grasp polygonal objects (context) - Mason, Goldberg et al. - 1988
5:   Mechanical Parts Orienting: The Case of a Polyhedron on a Table - Erdmann, Mason et al. - 1993

BibTeX entry:   (Update)

D. Eppstein. Reset sequences for monotonic automata. SIAM Journal of Computing, 19(3), 1990. http://citeseer.ist.psu.edu/eppstein90reset.html   More

@article{ eppstein90reset,
    author = "David Eppstein",
    title = "Reset Sequences for Monotonic Automata",
    journal = "SIAM J. Comput.",
    volume = "19",
    number = "3",
    pages = "500-510",
    year = "1990",
    url = "citeseer.ist.psu.edu/eppstein90reset.html" }
Citations (may not include all citations):
146   Computers and Intractibility: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
131   An Exploration of Sensorless Manipulation (context) - Mason, Erdmann - 1986
13   Parallel Computation and Conflicts in Memory Access (context) - Kucera - 1982  DBLP
10   An Algorithmic Approach to the Automated Design of Parts Ori.. (context) - Natarajan - 1986  DBLP
1   Orienting Parts by Computer Controlled Manipulation (context) - Grossman, Blasgen - 1975



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html):   More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996)   (Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999)   (Correct)
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC