Decision problems for cellular automata and their semigroups

DOI10.1007/3-540-55808-X_41zbMath1493.68236OpenAlexW1568949524MaRDI QIDQ5096855

John Pedersen

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_41

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Cellular automata (computational aspects) (68Q80) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
• Confluent and Other Types of Thue Systems
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• Simple Computation-Universal Cellular Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decision problems for cellular automata and their semigroups