Cascade decompositions are bit-vector algorithms

DOI10.1007/3-540-36390-4_2MaRDI QIDQ4412565zbMATH OpenFDO

Authors Anne Bergeron, Sylvie Hamel

Publication date 15 July 2003

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/2494/24940013.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• From cascade decompositions to bit-vector algorithms.
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• Fast implementations of automata computations
• On constructing and visualizing cascaded automata
• Vectorial languages and linear temporal logic

Cited in

(2)

• From cascade decompositions to bit-vector algorithms.
• Vectorial languages and linear temporal logic

This page was built for publication: Cascade decompositions are bit-vector algorithms

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