The site-perimeter of words
We define $[k]={1, 2, 3,ldots,k}$ to be a (totally ordered) {em alphabet} on $k$ letters. A {em word} $w$ of length $n$ on the alphabet $[k]$ is an element of $[k]^n$. A word can be represented by a bargraph which is a family of column-convex polyominoes whose lower edge lies on the $x$-axis...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2017-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://toc.ui.ac.ir/article_21465_6b2d0d7534fbdaeab5e1760bad7055c7.pdf |