%0 Conference Proceedings
%T L-Convex Polyominoes Are Recognizable in Real Time by 2D Cellular Automata
%+ Systèmes complexes, automates et pavages (ESCAPE)
%A Grandjean, Anaël
%A Poupet, Victor
%Z Part 2: Regular Papers
%< avec comité de lecture
%( 21st Workshop on Cellular Automata and Discrete Complex Systems
%B AUTOMATA
%C Turku, Finland
%Y Jarkko Kari
%3 Cellular Automata and Discrete Complex Systems
%V LNCS
%N 9099
%P 127-140
%8 2015-06-08
%D 2015
%Z 1610.00323v1
%R 10.1007/978-3-662-47221-7_10
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01442468/document
%2 https://inria.hal.science/hal-01442468/file/338243_1_En_10_Chapter.pdf
%L hal-01442468
%U https://inria.hal.science/hal-01442468
%~ CNRS
%~ IFIP-LNCS
%~ IFIP
%~ ESCAPE
%~ LIRMM
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ MIPS
%~ UNIV-MONTPELLIER
%~ UM-2015-2021