Bus automata and immediate languages

DOI10.1016/S0019-9958(79)90361-9zbMath0398.68022OpenAlexW2042095013MaRDI QIDQ4181968

No author found.

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(79)90361-9

zbMATH Keywords

AcceptanceCellular AutomatonHierarchies of Formal Languages Related to Parallel ComputationLocally Modifiable Long-Distance Communication Network

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (5)

Constant time sorting on a processor array with a reconfigurable bus system ⋮ Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model ⋮ Optimal simulation of multidimensional reconfigurable meshes by two- dimensional reconfigurable meshes ⋮ Deriving algorithms on reconfigurable networks based on function decomposition ⋮ Constant-time Hough transform on the processor arrays with reconfigurable bus systems

This page was built for publication: Bus automata and immediate languages