Abstract: A bidimensional bifix (in short bibifix) of a square matrix T is a square submatrix of T which occurs in the top-left and bottom-right corners of T. This allows us to extend the definition of bifix-free words and cross-bifix-free set of words to bidimensional structures. In this paper we exhaustively generate all the bibifix-free square matrices and we construct a particular non-expandable cross-bibifix-free set of square matrices. Moreover, we provide a Gray code for listing this set.
Recommendations
Cites work
- scientific article; zbMATH DE number 2186901 (Why is no real title available?)
- scientific article; zbMATH DE number 1792682 (Why is no real title available?)
- A New Approach to Cross-Bifix-Free Sets
- A note on bifix-free sequences (Corresp.)
- Algorithms on Strings
- Avoiding cross-bifix-free binary words
- Cross-Bifix-Free Codes Within a Constant Factor of Optimality
- On Generating the N-ary Reflected Gray Codes
- Two-dimensional prefix string matching and covering on square matrices
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
Cited in
(7)- Characterization and measure of infinite two-dimensional strong prefix codes
- Sets of pictures avoiding overlaps
- A simple suboptimal construction of cross-bifix-free codes
- A 2D non-overlapping code over a q-ary alphabet
- Non-overlapping matrices via Dyck words
- A Construction for Variable Dimension Strong Non-Overlapping Matrices
- Cross-bifix-free sets generation via Motzkin paths
This page was built for publication: Cross-bifix-free sets in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517032)
