Hierarchies and undecidability results for iterative arrays with sparse communication

DOI10.1007/978-3-319-92675-9_8OpenAlexW2991450735MaRDI QIDQ1656691

Andreas Malcher

Publication date: 10 August 2018

Full work available at URL: https://hal.inria.fr/hal-01824868/file/469010_1_En_8_Chapter.pdf

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

Iterative arrays with finite inter-cell communication ⋮ Iterative arrays with finite inter-cell communication

Cites Work

• Cellular automata with limited inter-cell bandwidth
• Two-dimensional iterative arrays: Characterizations and applications
• Signals in one-dimensional cellular automata
• Cellular automata with sparse communication
• Real-time language recognition by one-dimensional cellular automata
• On One-way One-bit O (One)-message Cellular Automata
• Parallel Parsing on a One-Way Array of Finite-State Machines
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hierarchies and undecidability results for iterative arrays with sparse communication