Parsing with a finite dictionary

J Clément, JP Duval, G Guaiana, D Perrin… - Theoretical Computer …, 2005 - Elsevier
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 …
被引用次数：14 相关文章
[PDF] core.ac.uk

[PDF][PDF] Parsing with a finite dictionary

J Clémenta, JP Duvalb, G Guaianab, D Perrina… - Theoretical Computer …, 2005 - core.ac.uk
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 …

Parsing with a finite dictionary

J Clément, JP Duval, G Guaiana, D Perrin… - Theoretical Computer …, 2005 - dl.acm.org
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 …

[引用][C] Parsing with a finite dictionary

J CLEMENT, JP DUVAL, G GUAIANA… - Theoretical …, 2005 - pascal-francis.inist.fr
Parsing with a finite dictionary CNRS Inist Pascal-Francis CNRS Pascal and Francis
Bibliographic Databases Simple search Advanced search Search by classification Search …

Parsing with a finite dictionary

J Clément, JP Duval, G Guaiana, D Perrin… - Theoretical Computer …, 2005 - infona.pl
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 …

[引用][C] Parsing with a finite dictionary

J CLEMENT, JP DUVAL, G GUAIANA… - Theoretical computer …, 2005 - Elsevier