Some remarks about the efficiency of polyautomata

DOI10.1007/BF02084165zbMath0526.68046OpenAlexW2087680187MaRDI QIDQ594595

Sumit K. Garg

Publication date: 1982

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02084165

zbMATH Keywords

pattern recognitioncellular automatalower boundsarray processorscellular algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80) Algorithms in computer science (68W99)

Related Items (9)

Counter machines and distributed automata -- a story about exchanging space and time ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ A design of generalized minimum-state-change FSSP algorithms and their implementations ⋮ A new reconstruction and the first implementation of Goto's FSSP algorithm ⋮ Cellular automata with sparse communication ⋮ Entropy of additive cellular automata ⋮ A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) ⋮ On One-way One-bit O (One)-message Cellular Automata ⋮ Cellular Automata with Sparse Communication

Cites Work

• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• One-tape, off-line Turing machine computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some remarks about the efficiency of polyautomata