Sequential and cellular graph automata

DOI10.1016/0020-0255(80)90024-9zbMath0456.68055OpenAlexW2070017566MaRDI QIDQ1151041

Azriel Rosenfeld, Angela Y. Wu

Publication date: 1980

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(80)90024-9

zbMATH Keywords

web-bounded automata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Cellular automata (computational aspects) (68Q80)

Related Items (1)

Algorithms for weighted graph problems on the modified cellular graph automaton

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Cellular graph automata. I. basic concepts, graph property measurement, closure properties
• Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
• Networks of Automata: Some Applications
• Web automata
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Tessellation Automata
• Graph property recognition machines

This page was built for publication: Sequential and cellular graph automata