From cascade decompositions to bit-vector algorithms.

DOI10.1016/J.TCS.2003.10.010MaRDI QIDQ1426154zbMATH OpenOpenAlexWikidataFDO

Authors Anne Bergeron, Sylvie Hamel

Publication date 14 March 2004

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

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

zbMATH Keywords

Bit-vector algorithmsCascade decompositionsCounter-free automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1949642
• scientific article; zbMATH DE number 4007583
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• scientific article; zbMATH DE number 1773073
• On-line construction of compact suffix vectors and maximal repeats

Cites work

• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• Complexity of some problems from the theory of automata
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

Cited in

(3)

• Vectorial languages and linear temporal logic
• From relation to emulation and interpretation: computer algebra implementation of the covering lemma for finite transformation semigroups
• scientific article; zbMATH DE number 1949642 (Why is no real title available?)

This page was built for publication: From cascade decompositions to bit-vector algorithms.

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