Bus automata and immediate languages

https://doi.org/10.1016/S0019-9958(79)90361-9Get rights and content
Under an Elsevier user license
open archive

Bus automata are defined as a class of uniform arrays of finite automata (“cells”) with modifiable channels through cells which allow long-distance communication. This permits separation of the functions of state change (or switching) and information transmission, and analysis of their respective time costs. Most previous cellular automaton research does not make this distinction. We define immediate languages as those formal languaves accepted in a fixed number of steps by bus automata, regardless of the size of the input. Similarities to other hierarchies of formal languages related to parallel computation are explored, and evidence for the existence of a family of “inherently parallel” languages is discussed.

Cited by (0)