Parsing with a finite dictionary

Authors:
Julien Clément;Jean-Pierre Duval;Giovanna Guaiana;Dominique Perrin;Giuseppina Rindone
Affiliations:
Institut Gaspard-Monge, Université de Marne-la-Vallée, France;LIFAR, Université de Rouen, France;LIFAR, Université de Rouen, France;Institut Gaspard-Monge, Université de Marne-la-Vallée, France;Institut Gaspard-Monge, Université de Marne-la-Vallée, France
Venue:
Theoretical Computer Science - The art of theory
Year:
2005

Citing 7
Cited 1

Pattern matching machine implementation of a fast test for unique decipherability

Information Processing Letters
Finite automata

Handbook of theoretical computer science (vol. B)
Minimisation of acyclic deterministic automata in linear time

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Regular languages

Handbook of formal languages, vol. 1
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
A Note on Unique Decipherability

Proceedings of the Mathematical Foundations of Computer Science 1984

The Average State Complexity of the Star of a Finite Set of Words Is Linear

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.