Abstract
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the links between the existence of vector algorithms and the cascade decompositions of counter-free automata.
We show that any computation that can be carried out with a counter-free automaton can be recast as a vector algorithm. Moreover, we show that for a class of automata that is closely related to algorithms in bio-computing, the complexity of the resulting algorithms is linear in the number of transitions of the original automaton.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Bergeron and S. Hamel, Vector Algorithms for Approximate String Matching (to appear in IJFCS).
A. Bergeron and S. Hamel, Cascade Decompositions are Bit-Vector Algorithms, http://www.lacim.uqam.ca/~anne.
K. Krohn and J. L. Rhodes, Algebraic Theory of machines, Transactions of the American Mathematical Society, 116, (1965), 450–464.
O. Maler and A. Pnueli, Tight Bounds on the Complexity of Cascaded Decomposition Theorem, 31st Annual Symposium on Foundations of Computer Science IEEE, volume II, (1990), 672–682.
O. Maler and A. Pnueli, On the Cascaded Decomposition of Automata, its Complexity and its Application to Logic, unpublished manuscript available at http://www-verimag.imag.fr/PEOPLE/maler/uabst.html, (1994), 48 pages.
E. Myers, A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming, J. ACM, 46-3, (1999) 395–415.
J. Stern, Complexity of some Problems from the Theory of Automata, Information and Control, 66, (1985), 163–176.
H. P. Zeiger, Cascade Synthesis of Finite-State Machines, Information and Control, 10, (1967), 419–433.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergeron, A., Hamel, S. (2002). Cascade Decompositions are Bit-Vector Algorithms. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-36390-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00400-4
Online ISBN: 978-3-540-36390-3
eBook Packages: Springer Book Archive