TWiki
>
CoWiki Web
>
Avoidance
>
AvoidingPatternsUnderInvolution
(2012-03-12,
DirkNowotka
)
(raw view)
E
dit
A
ttach
Patterns can be generalized by adding functional dependencies between variables. Here, we consider involutions ϑ, that is, ϑ(ϑ(_a_)) = <i>a</i> for all letters _a_, and their morphic/antimorphic extensions on words, that is, ϑ(_uv_) = ϑ(_u_)ϑ(_v_) for the morphic and ϑ(_uv_) = ϑ(_v_)ϑ(_u_) for the antimorphic case. A pattern _p_ in this setting consists now of (word) variables and function variables and it is avoided in some infinite word *w* if there exists no substitution of (word) variables by words and function variables by involutions for _p_ such that the result is a factor of *w*. The morphic and antimorphic cases are usually considered separately. The avoidance indices of all unary patterns under involution are known. See <div style="padding-left: 30px;">B. Bischoff, J. Currie, D. Nowotka, _Unary Patterns With Involution_, (reference to be completed).</div> Let _p_ be a pattern consisting of only one (word) variable and at most one function variable. Then for both the morphic and antimorphic case _p_ is * avoidable over three letters, if _p_ is of length 3 and not in {ααα, ϑ(α)ϑ(α)ϑ(α)}, * unavoidable, if _p_ is in {α, ϑ(α), αϑ(α), ϑ(α)α}, and * avoidable over two letters otherwise. -- Main.DirkNowotka - 12 Mar 2012
E
dit
|
A
ttach
|
Watch
|
P
rint version
|
H
istory
: r1
|
B
acklinks
|
V
iew topic
|
Ra
w
edit
|
M
ore topic actions
Topic revision: r1 - 2012-03-12
-
DirkNowotka
CoWiki
CoWiki Web
CoWiki Web Home
Changes
Index
Search
Webs
AIMAS
CERAS
CF
CoWiki
CrySP
External
Faqtest
HCI
Himrod
ISG
Main
Multicore
Sandbox
TWiki
TestNewSandbox
TestWebS
UW
My links
People
CERAS
WatForm
Tetherless lab
Ubuntu Main.HowTo
eDocs
RGG NE notes
RGG
CS infrastructure
Grad images
Edit
Copyright © 2008-2025 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki?
Send feedback