Abstract
The notion of unbordered picture generalizes to two dimensions the notion of unbordered (or bifix-free) string. We extend to two dimensions Nielsen’s construction of unbordered strings ([23]) and describe an algorithm to construct the set U(m, n) of unbordered pictures of fixed size (m, n). The algorithm recursively computes the set of quasi-unbordered pictures Q(m, n), i.e. pictures that can possibly have some “large” borders.
Author supplied keywords
Cite
CITATION STYLE
Anselmo, M., Giammarresi, D., & Madonia, M. (2015). Unbordered pictures: Properties and construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9270, pp. 45–57). Springer Verlag. https://doi.org/10.1007/978-3-319-23021-4_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
