Abstract
In this paper we show that the set of plus- respectively minus-decomposable permutations of a regular class under the rank encoding form regular sublanguages. Plus- respectively minus-decomposable permutations are permutations allowing for a special kind of block-decomposition. The language theoretic results shown have different approaches, even though the properties of plus- and minus-decomposability of permutations are similar.
| Original language | English |
|---|---|
| Pages (from-to) | 143-150 |
| Number of pages | 8 |
| Journal | Pure Math. Appl. (PU.M.A.) |
| Volume | 24 |
| Issue number | 2 |
| Publication status | Published - 2013 |
Keywords
- Permutation class
- Permutation pattern
- Permutation
- Word
- Automaton