TWiki
>
CoWiki Web
>
ImportantOpenProblems
>
SAdicConjecture
(2011-07-13,
JeffreyShallit
)
E
dit
A
ttach
The S-adic conjecture: find the correct conditions on a sequence of morphisms so that an infinite word has linear complexity, if, and only if, it is generated by such a sequence of composed morphisms.
--
JeffreyShallit
- 13 Jul 2011
E
dit
|
A
ttach
|
Watch
|
P
rint version
|
H
istory
: r1
|
B
acklinks
|
R
aw View
|
Ra
w
edit
|
M
ore topic actions
Topic revision: r1 - 2011-07-13
-
JeffreyShallit
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-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki?
Send feedback