Skip to Main content Skip to Navigation
Conference papers

L-Convex Polyominoes Are Recognizable in Real Time by 2D Cellular Automata

Anaël Grandjean 1 Victor Poupet 1 
1 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : A polyomino is said to be L-convex if any two of its cells are connected by a 4-connected inner path that changes direction at most once. The 2-dimensional language representing such polyominoes has been recently proved to be recognizable by tiling systems by S. Brocchi, A. Frosini, R. Pinzani and S. Rinaldi. In an attempt to compare recognition power of tiling systems and cellular automata, we have proved that this language can be recognized by 2-dimensional cellular automata working on the von Neumann neighborhood in real time.Although the construction uses a characterization of L-convex polyominoes that is similar to the one used for tiling systems, the real time constraint which has no equivalent in terms of tilings requires the use of techniques that are specific to cellular automata.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, January 20, 2017 - 4:09:07 PM
Last modification on : Friday, August 5, 2022 - 3:02:59 PM
Long-term archiving on: : Friday, April 21, 2017 - 4:08:15 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Anaël Grandjean, Victor Poupet. L-Convex Polyominoes Are Recognizable in Real Time by 2D Cellular Automata. AUTOMATA, Jun 2015, Turku, Finland. pp.127-140, ⟨10.1007/978-3-662-47221-7_10⟩. ⟨hal-01442468⟩



Record views


Files downloads