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'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 7
Cited 1

The equivalence problem of multitape finite automata

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Design and implementation of a string database query language

Information Systems - Special issue: Data management in bioinformatics
Reducing NFAs by invariant equivalences

Theoretical Computer Science
NFA reduction algorithms by means of regular inequalities

Theoretical Computer Science - Developments in language theory
On the State Minimization of Nondeterministic Finite Automata

IEEE Transactions on Computers
Finite automata and their decision problems

IBM Journal of Research and Development

On size reduction techniques for multitape automata

Theoretical Computer Science - Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for size reduction of two-way multitape 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.