On the Minimal Uncompletable Word Problem

Details On the Minimal Uncompletable Word Problem On the Minimal Uncompletable Word Problem

2010-02-09

arxiv.org/abs/1002.1928v2

Computer Science

Formal Languages and Automata Theory

5 pages; added references, corrected typos

Scientific paper

Let S be a finite set of words over an alphabet Sigma. The set S is said to
be complete if every word w over the alphabet Sigma is a factor of some element
of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are
interested in finding bounds on the minimal length of words in Sigma* which are
not elements of Fact(S*) in terms of the maximal length of words in S.

Affiliated with

Also associated with

No associations

Rating

On the Minimal Uncompletable Word Problem 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 the Minimal Uncompletable Word Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Minimal Uncompletable Word Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125196