Fast implementations of automata computations

DOI10.1007/3-540-44674-5_3MaRDI QIDQ4540956zbMATH OpenFDO

Authors Anne Bergeron, Sylvie Hamel

Publication date 28 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2088/20880047

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45)

Recommendations

• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• String Processing and Information Retrieval
• scientific article; zbMATH DE number 4053031
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Faster bit-parallel approximate string matching

Cited in

(4)

• From cascade decompositions to bit-vector algorithms.
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• Cascade decompositions are bit-vector algorithms
• Output concepts for accelerated Turing machines

This page was built for publication: Fast implementations of automata computations

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