On the Minimal Uncompletable Word Problem

13 years 1 months ago

Download www.i3s.unice.fr

Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of words in S.

Gabriele Fici, Elena V. Pribavkina, Jacques Sakaro

Real-time Traffic

CORR 2010 | Education | Maximal Length |

claim paper

» Coclustering Documents and Words by Minimizing the Normalized Cut Objective Function

» Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Contro...

» Proximal Alternating Minimization and Projection Methods for Nonconvex Problems An Approac...

» Estimating the Lengths of Memory Words

» On the Complexity of the Whitehead Minimization Problem

» A Fast Multigrid Algorithm for Energy Minimization under Planar Density Constraints

» Minimizing Word Error Rate in Textual Summaries of Spoken Language

» A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch

Comments (0)

Sciweavers

On the Minimal Uncompletable Word Problem

CORR 2010 | Education | Maximal Length |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers