Conjugacy of One-Dimensional One-Sided Cellular Automata is Undecidable

From MaRDI portal

Revision as of 14:04, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5127182

Jump to:navigation, search

DOI10.1007/978-3-319-73117-9_16zbMath1444.68107arXiv1710.08111OpenAlexW2963705931WikidataQ62045868 ScholiaQ62045868MaRDI QIDQ5127182

Jarkko Kari, Joonatan Jalonen

Publication date: 21 October 2020

Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.08111

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (3)

On dynamical complexity of surjective ultimately right-expansive cellular automata ⋮ On the conjugacy problem of cellular automata ⋮ Unnamed Item

This page was built for publication: Conjugacy of One-Dimensional One-Sided Cellular Automata is Undecidable

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5127182&oldid=19657382"