States and Heads Do Count for Unary Multi-head Finite Automata

  • Martin Kutrib
  • Andreas Malcher
  • Matthias Wendlandt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7410)

Abstract

Unary deterministic one-way multi-head finite automata characterize the unary regular languages. Here they are studied with respect to the existence of head and state hierarchies. It turns out that for any fixed number of states, there is an infinite proper head hierarchy. In particular, the head hierarchy for stateless deterministic one-way multi-head finite automata is obtained using unary languages. On the other hand, it is shown that for a fixed number of heads, m + 1 states are more powerful than m states. Finally, the open question of whether emptiness is undecidable for stateless one-way two-head finite automata is addressed and, as a partial answer, undecidability can be shown if at least four states are provided.

Keywords

Cycle Length Finite Automaton Input Symbol State Hierarchy Longe Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chrobak, M.: Hierarchies of one-way multihead automata languages. Theoret. Comput. Sci. 48, 153–181 (1986)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)MATHGoogle Scholar
  3. 3.
    Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoret. Comput. Sci. 412, 83–96 (2011)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  5. 5.
    Ibarra, O.H.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Inform. Process. Lett. 3, 25–28 (1974)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Ibarra, O.H., Karhumäki, J., Okhotin, A.: On stateless multihead automata: Hierarchies and the emptiness problem. Theoret. Comput. Sci. 411, 581–593 (2010)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Kutyłowski, M.: One-way multihead finite automata and 2-bounded languages. Math. Systems Theory 23, 107–139 (1990)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Rosenberg, A.L.: On multi-head finite automata. IBM J. Res. Dev. 10, 388–394 (1966)MATHCrossRefGoogle Scholar
  10. 10.
    Sudborough, I.H.: Bounded-reversal multihead finite automata languages. Inform. Control 25, 317–328 (1974)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. Int. J. Found. Comput. Sci. 19, 1259–1276 (2008)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Yao, A.C., Rivest, R.L.: k + 1 heads are better than k. J. ACM 25, 337–340 (1978)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Martin Kutrib
    • 1
  • Andreas Malcher
    • 1
  • Matthias Wendlandt
    • 1
  1. 1.Institut für InformatikUniversität GiessenGiessenGermany

Personalised recommendations