From cascade decompositions to bit-vector algorithms.

DOI10.1016/J.TCS.2003.10.010zbMath1069.68062OpenAlexW2029413222WikidataQ60704267 ScholiaQ60704267MaRDI QIDQ1426154

Sylvie Hamel, Anne Bergeron

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)

Cites Work

• Unnamed Item
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Complexity of some problems from the theory of automata
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines

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