Comparing 1D and 2D real time on cellular automata

DOI10.4230/LIPICS.STACS.2015.367zbMATH Open1355.68185arXiv1610.00331MaRDI QIDQ2955009FDOQ2955009

Authors: Anaël Grandjean, Victor Poupet 

Publication date: 24 January 2017

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

Recommendations

• Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
• scientific article; zbMATH DE number 3872685
• Two-dimensional cellular automata recognizer
• Differences between 2D neighborhoods according to real time computation
• Publication:4941904

zbMATH Keywords

real timecellular automatalanguage recognition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cited In (5)

• Real-time recognition of languages on an two-dimensional Archimedean thread
• Two-dimensional cellular automata and deterministic on-line tessalation automata
• Differences between 2D neighborhoods according to real time computation
• Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
• Title not available (Why is that?)

This page was built for publication: Comparing 1D and 2D real time on cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2955009)