On Non-Complete Sets and Restivo's Conjecture

Details On Non-Complete Sets and Restivo's Conjecture On Non-Complete Sets and Restivo's Conjecture

2011-04-03

arxiv.org/abs/1104.0388v1

Computer Science

Formal Languages and Automata Theory

11 pages

Scientific paper

A finite set S of words over the alphabet A is called non-complete if Fact(S*) is different from A*. A word w in A* - Fact(S*) is said to be uncompletable. We present a series of non-complete sets S_k whose minimal uncompletable words have length 5k^2 - 17k + 13, where k > 3 is the maximal length of words in S_k. This is an infinite series of counterexamples to Restivo's conjecture, which states that any non-complete set possesses an uncompletable word of length at most 2k^2.

Affiliated with

Also associated with

No associations

Rating

On Non-Complete Sets and Restivo's Conjecture 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 On Non-Complete Sets and Restivo's Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Non-Complete Sets and Restivo's Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131927