Pattern Avoidability with Involution

Details Pattern Avoidability with Involution Pattern Avoidability with Involution

2011-08-18

arxiv.org/abs/1108.3622v1

EPTCS 63, 2011, pp. 65-70

Computer Science

Formal Languages and Automata Theory

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.10

An infinte word w avoids a pattern p with the involution t if there is no substitution for the variables in p and no involution t such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the size of the alphabet. For example, it is shown that the pattern a t(a) a can be avoided over three letters but not two letters, whereas it is well known that a a a is avoidable over two letters.

Affiliated with

Also associated with

No associations

Rating

Pattern Avoidability with Involution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern Avoidability with Involution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern Avoidability with Involution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180577