Parsing with a finite dictionary

We address the following issue: given a word w ∈ A * and a set of n nonempty words X, how does one determine efficiently whether w ∈ X * or not? We discuss several methods including an O ( r × | w | + | X | ) algorithm for this problem where r ⩽ n is the length of a longest suffix chain of X and | X...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 340; no. 2; pp. 432 - 442
Main Authors Clément, Julien, Duval, Jean-Pierre, Guaiana, Giovanna, Perrin, Dominique, Rindone, Giuseppina
Format Journal Article
LanguageEnglish
Published Elsevier B.V 27.06.2005
Subjects
Finite automata
String matching
Finite automata
String matching
Online AccessGet full text

Cover

More Information
Summary:We address the following issue: given a word w ∈ A * and a set of n nonempty words X, how does one determine efficiently whether w ∈ X * or not? We discuss several methods including an O ( r × | w | + | X | ) algorithm for this problem where r ⩽ n is the length of a longest suffix chain of X and | X | is the sum of the lengths of words in X. We also consider the more general problem of providing all the decompositions of w in words of X.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2005.03.030