Parsing with a finite dictionary
From MaRDI portal
Publication:2484450
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
Cites work
- scientific article; zbMATH DE number 3883641 (Why is no real title available?)
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3982538 (Why is no real title available?)
- scientific article; zbMATH DE number 3641729 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 5263622 (Why is no real title available?)
- Efficient string matching
- Jewels of Stringology
- Minimisation of acyclic deterministic automata in linear time
Cited in
(3)
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)