Computing with Snakes in Directed Networks of Automata

DOI10.1006/JAGM.1996.0840MaRDI QIDQ4349702zbMATH OpenOpenAlexFDO

Authors Shimon Even, Ami Litman, Peter Winkler

Publication date 4 February 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/bc994ce2f0514aeb02defd32d0fb399733570b51

zbMATH Keywords

finite-state automata

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2119713
• The wake up and report problem is time-equivalent to the firing squad synchronization problem
• Distributed Algorithms For Unidirectional Networks
• On the Complexity of the “Most General” Firing Squad Synchronization Problem
• An efficient solution of the firing mob problem

Cited in

(6)

• Determination of the topology of a directed network
• Smaller solutions for the firing squad
• The wake up and report problem is time-equivalent to the firing squad synchronization problem
• Flat Holonomies on Automata Networks
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• Bounding the firing synchronization problem on a ring

This page was built for publication: Computing with Snakes in Directed Networks of Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4349702)