A note on time-bounded bottom-up pyramid cellular acceptors
From MaRDI portal
Publication:918727
DOI10.1016/0020-0255(90)90021-2zbMath0706.68078OpenAlexW2002924454MaRDI QIDQ918727
Itsuo Takanami, Katsushi Inoue
Publication date: 1990
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(90)90021-2
two-dimensional finite automatacellular acceptorsnondeterministic two- dimensional on-line tessellation acceptorstime-bounded bottom-up pyramid
Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
A survey of two-dimensional automata theory ⋮ Integer merging on EREW PRAM ⋮ Two-node-Hamiltonicity of enhanced pyramid networks
Cites Work
- A note on bottom-up pyramid acceptors
- Two-dimensional alternative Turing machines
- A note on deterministic three-way tape-bounded two-dimensional Turing machines
- Corrections to Cyclic closure properties of automata on a two- dimensional tape and A note on deterministic three-way tape-bounded two-dimensional Turing machines
- Some properties of two-dimensional on-line tessellation acceptors
- A note on two-dimensional finite automata
- Unnamed Item