Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2000: Computing and Combinatorics pp 457–466Cite as

On the Power of Input-Synchronized Alternating Finite Automata

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1858))

Abstract

In this paper, we introduce a new model of automata, called input-synchronized alternating finite automata (i-SAFAs), and study the power of i-SAFAs. We here consider two types of i-SAFAs, oneway i-SAFAs and two-way i-SAFAs. Then we show that (1) the class of languages accepted by one-way i-SAFAs is equal to the class of regular languages, (2) two-way i-SAFAs are more powerful than one-way i-SAFAs, that is, there exists a language L such that L is accepted by a two-way i-SAFA but not accepted by any one-way i-SAFAs. In addition, we show that the class of languages accepted by f(n) parallel-bounded two-way i-SAFAs is included in Nspace(S(n)), where S(n) = minn log n, f(n) log n.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.K. Chandra, D.C. Kozen and L.J. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28,1, 114–133, 1981.

    MATH  MathSciNet  Google Scholar 

  2. O.H. Ibarra and N.Q. Tran, On communication-bounded synchronized alternating finite automata, Acta Informatica, 31,4, 315–327, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Dassow, J. Hromkovic, J. Karhuaki, B. Rovan and A. Slobodova, On the power of synchronization in parallel computation, In Proc. 14th MFCS’89, LNCS 379, 196–206, 1989.

    Google Scholar 

  4. J.E. Hopcroft and J.D. Ullman, Introduction to automata theory language and computation, Addison Wesley, Reading Mass, 1979.

    Google Scholar 

  5. J. Hromkovic, K. Inoue, B. Rovan, A. Slobodova, I. Takanami and K.W. Wagner, On the power of one-way synchronized alternating machines with small space, International Journal of Foundations of Computer Science, 3,1, 65–79, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Hromkovic and K. Inoue, A note on realtime one-way synchronized alternating one-counter automata, Theoret. Comput. Sci., 108,2, 393–400, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Hromkovic, B. Rovan and A. Slobodova, Deterministic versus nondeterministic space in terms of synchronized alternating machines, Theoret. Comput. Sci., 132,2, 319–336, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  8. R.E. Ladner, R.J. Ripton and L.J. Stockmeyer, Alternating pushdown and stack automata, SIAM J. Computing, 13,1, 1984.

    Google Scholar 

  9. A. Slobodova, On the power of communication in alternating machines, In Proc. 13th MFCS’88, LNCS 324, 518–528, 1988.

    Google Scholar 

  10. M.Y. Vardi, Alternating automata and program verification, In Computer Science Today-Recent Trends and Developments, LNCS 1000, 471–485, 1996.

    Google Scholar 

  11. H. Yamamoto, An automata-based recognition algorithm for semi-extended regular expressions, manuscript, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Shinshu University, 4-17-1 Wakasato, Nagano-shi, 380-8553, Japan

    Hiroaki Yamamoto

Authors
  1. Hiroaki Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, MN 55455, Minneapolis, USA

    Ding-Zhu Du

  2. Department of Computer Science and Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia

    Peter Eades  & Vladimir Estivill-Castro  & 

  3. School of Computer Science and Engineering, University of Newcastle, NSW 2052, Sydney, Australia

    Xuemin Lin  & Arun Sharma  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamamoto, H. (2000). On the Power of Input-Synchronized Alternating Finite Automata. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation