Size reduction of multitape automata

Authors:
Hellis Tamm;Matti Nykänen;Esko Ukkonen
Affiliations:
Department of Computer Science, University of Helsinki, Finland;Department of Computer Science, University of Helsinki, Finland;Department of Computer Science, University of Helsinki, Finland
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 2
Cited 0

Design and implementation of a string database query language

Information Systems - Special issue: Data management in bioinformatics
Finite automata and their decision problems

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several models of multitape automata have been introduced over the years. Here we consider a modified version of the Rabin-Scott model [2] motivated by the needs of developing a string manipulating database system of [1]. We present an algorithm to reduce the size of a multitape automaton in this model. The algorithm uses certain local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states together into a single state. Although the resulting automaton is not necessarily minimal, the size of the automaton may be reduced considerably as the example below indicates.