Skip to main content
SpringerLink
Log in

Size Reduction of Multitape Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3845))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114–125 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  2. Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78, 347–355 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  4. Kameda, T., Weiner, P.: On the state minimization of nondeterministic automata. IEEE Trans. Comput. C-19, 617–627 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  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. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  7. Ilie, L., Yu, S.: Reducing NFAs by invariant equivalences. Theoretical Computer Science 306, 373–390 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  9. Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities. Theoretical Computer Science 327, 241–253 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, P.O. Box 68, 00014, Finland

    Hellis Tamm, Matti Nykänen & Esko Ukkonen

Authors
  1. Hellis Tamm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matti Nykänen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Esko Ukkonen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, 2000, route des lucioles, BP 121, 06903, Sophia Antipolis - Cedex, France

    Jacques Farré

  2. Sophia Antipolis, Ecole Polytechnique, Université de Nice, 930, route des colles, BP 145, 06903, Sophia Antipolis - Cedex, France

    Igor Litovsky

  3. Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, France

    Sylvain Schmitz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamm, H., Nykänen, M., Ukkonen, E. (2006). Size Reduction of Multitape Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_26

Download citation

  • DOI: https://doi.org/10.1007/11605157_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31023-5

  • Online ISBN: 978-3-540-33097-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation