Parsing with a finite dictionary

DOI10.1016/J.TCS.2005.03.030zbMATH Open1102.68058OpenAlexW2003031575MaRDI QIDQ2484450FDOQ2484450

Authors: Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone, Julien Clément, J.-P. Duval 

Publication date: 1 August 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.030

Recommendations

• La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
• An algorithm for the decomposition of finite languages
• scientific article; zbMATH DE number 1836426
• Dictionary-symbolwise flexible parsing
• On-line construction of a small automaton for a finite set of words

zbMATH Keywords

string matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Efficient string matching
• Title not available (Why is that?)
• Title not available (Why is that?)
• Jewels of Stringology
• Title not available (Why is that?)
• Minimisation of acyclic deterministic automata in linear time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• The Average State Complexity of the Star of a Finite Set of Words Is Linear
• The average state complexity of rational operations on finite languages

This page was built for publication: Parsing with a finite dictionary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484450)