We present a method for size reduction of two-way multi-tape automata. Our algorithm applies local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states into a single state. Our work is motivated by implementation of a language for string manipulation in database systems where string predicates are compiled into two-way multitape automata. Additionally, we present a (one-tape) NFA reduction algorithm that is based on a method proposed for DFA minimization by Kameda and Weiner, and apply this algorithm, combined with the multitape automata reduction algorithm, on our multitape automata. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Tamm, H., Nykänen, M., & Ukkonen, E. (2006). Size reduction of multitape automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3845 LNCS, pp. 307–318). https://doi.org/10.1007/11605157_26
Mendeley helps you to discover research relevant for your work.