Unary Patterns of Size Four with Morphic Permutations

02/05/2019
by   Kamellia Reshadi, et al.
0

We investigate the avoidability of unary patterns of size of four with morphic permutations. More precisely, we show that, for the positive integers i,j,k, the sizes of the alphabets over which a pattern x π ^ i (x) π^j(x) π^k(x) is avoidable are an interval of the integers (where x is a word variable and π is a function variable with values in the set of all morphic permutations of the respective alphabets). We also show how to compute a good approximation of this interval. This continues the work of [Manea et al., 2015], where a complete characterisation of the avoidability of cubic patterns with permutations was given.

READ FULL TEXT
research
09/11/2017

Mining relevant interval rules

This article extends the method of Garriga et al. for mining relevant ru...
research
06/02/2015

Fast Generation of Best Interval Patterns for Nonmonotonic Constraints

In pattern mining, the main challenge is the exponential explosion of th...
research
06/10/2019

Efficient enumeration of non-isomorphic interval graphs

Recently, Yamazaki et al. provided an algorithm that enumerates all non-...
research
11/27/2020

Adaptive Non-linear Pattern Matching Automata

Efficient pattern matching is fundamental for practical term rewrite eng...
research
06/17/2019

Matching Patterns with Variables

A pattern p (i.e., a string of variables and terminals) matches a word w...
research
06/28/2022

Extending Shinohara's Algorithm for Computing Descriptive (Angluin-Style) Patterns to Subsequence Patterns

The introduction of pattern languages in the seminal work [Angluin, “Fin...
research
10/11/2022

On Monotonicities of Interval Valued Functions

In this paper we introduce the notion of conditional monotonicity and fr...

Please sign up or login with your details

Forgot password? Click here to reset