scientific article; zbMATH DE number 3237733
From MaRDI portal
Publication:5525259
zbMath0147.24107MaRDI QIDQ5525259
No author found.
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Collections of reprinted articles (00B60)
Related Items (28)
Synchronization of 1-way connected processors ⋮ On optimal solutions to the firing squad synchronization problem ⋮ Generalized finite automata theory with an application to a decision problem of second-order logic ⋮ Variations of the firing squad problem and applications ⋮ Complementing deterministic Büchi automata in polynomial time ⋮ Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Linear speed-up for cellular automata synchronizers and applications ⋮ Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability) ⋮ Partitioning a graph in \(O(|A|\log_ 2|V|)\) ⋮ Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position ⋮ Unnamed Item ⋮ The wake up and report problem is time-equivalent to the firing squad synchronization problem ⋮ Algebraic and topological theory of languages ⋮ Modal functions for concise definition of state machines and products ⋮ A Compositional Approach to Synchronize Two Dimensional Networks of Processors ⋮ The synchronization of nonuniform networks of finite automata ⋮ Products of Automata and the Problem of Covering ⋮ A linear speed-up theorem for cellular automata ⋮ Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines ⋮ Regular subsets in semi-direct products of monoids ⋮ Church’s Problem and a Tour through Automata Theory ⋮ A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) ⋮ Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks ⋮ Finite synchronous automata ⋮ A universal cellular automaton in quasi-linear time and its S-m-n form ⋮ Reversibility and surjectivity problems of cellular automata ⋮ Generalized finite automata theory with an application to a decision problem of second-order logic
This page was built for publication:
