On the Generation of 2-Polyominoes

Abstract : 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).
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

Contributor : Hal Ifip <>
Submitted on : Friday, October 26, 2018 - 8:01:37 AM
Last modification on : Friday, October 26, 2018 - 8:05:06 AM
Long-term archiving on : Sunday, January 27, 2019 - 1:14:39 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2021-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Enrico Formenti, Paolo Massazza. On the Generation of 2-Polyominoes. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.101-113, ⟨10.1007/978-3-319-94631-3_9⟩. ⟨hal-01905637⟩



Record views