Size Reduction of Multitape Automata

  • Hellis Tamm
  • Matti Nykänen
  • Esko Ukkonen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3845)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114–125 (1959)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78, 347–355 (1991)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Grahne, G., Hakli, R., Nykänen, M., Tamm, H., Ukkonen, E.: Design and implementation of a string database query language. Inform. Syst. 28, 311–337 (2003)CrossRefMATHGoogle Scholar
  4. 4.
    Kameda, T., Weiner, P.: On the state minimization of nondeterministic automata. IEEE Trans. Comput. C-19, 617–627 (1970)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Tamm, H.: On minimality and size reduction of one-tape and multitape finite automata. PhD thesis, Department of Computer Science, University of Helsinki, Finland (2004)Google Scholar
  6. 6.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  7. 7.
    Ilie, L., Yu, S.: Reducing NFAs by invariant equivalences. Theoretical Computer Science 306, 373–390 (2003)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Ilie, L., Navarro, G., Yu, S.: On NFA reductions. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 112–124. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities. Theoretical Computer Science 327, 241–253 (2004)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hellis Tamm
    • 1
  • Matti Nykänen
    • 1
  • Esko Ukkonen
    • 1
  1. 1.Department of Computer ScienceUniversity of HelsinkiFinland

Personalised recommendations