%0 Conference Proceedings
%T On the Generation of 2-Polyominoes
%+ COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)
%+ Universitá degli Studi dell’Insubria = University of Insubria [Varese] (Uninsubria)
%A Formenti, Enrico
%A Massazza, Paolo
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 20th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Halifax, NS, Canada
%Y Stavros Konstantinidis
%Y Giovanni Pighizzini
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10952
%P 101-113
%8 2018-07-25
%D 2018
%R 10.1007/978-3-319-94631-3_9
%Z Computer Science [cs]Conference papers
%X The class of 2-polyominoes contains all polyominoes P such that for any integer i, the first i columns of P consist of at most 2 polyominoes. We provide a decomposition that allows us to exploit suitable discrete dynamical systems to define an algorithm for generating all 2-polyominoes of area n in constant amortized time and space O(n).
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01905637/document
%2 https://inria.hal.science/hal-01905637/file/470153_1_En_9_Chapter.pdf
%L hal-01905637
%U https://inria.hal.science/hal-01905637
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ UNIV-COTEDAZUR
%~ IFIP-LNCS-10952