Non-overlapping matrices
From MaRDI portal
Publication:728263
DOI10.1016/J.TCS.2016.05.009zbMATH Open1355.68284arXiv1601.07723OpenAlexW2963368832MaRDI QIDQ728263FDOQ728263
Authors: Elena Barcucci, Antonio Bernini, S. Bilotta, R. Pinzani
Publication date: 19 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the -generalized Fibonacci numbers. Moreover, the generating function for the enumerating sequence is easily seen to be rational.
Full work available at URL: https://arxiv.org/abs/1601.07723
Recommendations
Combinatorics in computer science (68R05) Computing methodologies for image processing (68U10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Title not available (Why is that?)
- Two-dimensional prefix string matching and covering on square matrices
- A simple suboptimal construction of cross-bifix-free codes
- Unbordered pictures: properties and construction
- A note on bifix-free sequences (Corresp.)
- A New Approach to Cross-Bifix-Free Sets
- Cross-Bifix-Free Codes Within a Constant Factor of Optimality
- Title not available (Why is that?)
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
- Structure and measure of a decidable class of two-dimensional codes
- Non-Overlapping Codes
Cited In (5)
This page was built for publication: Non-overlapping matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q728263)