In [3] the authors proposed a classification of convex polyominoes based on the number of changes of direction in the paths connecting any two cells of a polyomino. More precisely, a convex polyomino is k-convex if every pair of its cells can be connected by a monotone path with at most k changes of direction. In 1-convex (also called L-convex) polyominoes, any two cells can be connected by a path with at most one change of direction. © 2011 Springer-Verlag.
Battaglino, D., Fedou, J.M., Frosini, A., Rinaldi, S. (2011). Encoding centered polyominoes by means of a regular language. In Developments in Language Theory (pp.275-283). Springer-Verlag Berlin Heidelberg [10.1007/978-3-642-22321-1_40].
Encoding centered polyominoes by means of a regular language
Battaglino D.;Rinaldi S.
2011-01-01
Abstract
In [3] the authors proposed a classification of convex polyominoes based on the number of changes of direction in the paths connecting any two cells of a polyomino. More precisely, a convex polyomino is k-convex if every pair of its cells can be connected by a monotone path with at most k changes of direction. In 1-convex (also called L-convex) polyominoes, any two cells can be connected by a path with at most one change of direction. © 2011 Springer-Verlag.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/27923
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo