Advertisement

Multihead finite state automata am concatenation

  • Pavol Ďuriš
  • Juraj Hromkovič
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

The following results are shown :
  1. (1)

    The class of languages accepted by the one-way nondeterministic simple k-head finite automata ℒ(NSPk-HFA) is not closed under concatenation for any k≥2.

     
  2. (2)

    The class k U ℒ(NSPk-HFA) is closed under concatenation.

     
  3. (3)

    The class of languages recognized by one-way k-head deterministic finite state automata ℒ(1DFA(k)) and the class of languages recognized by one-way k-head deterministic sensing finite state automata ℒ(1DSeFA(k)) are not closed under concatenation, Kleene star and reversal.

     

Keywords

Finite State Machine Finite Automaton Finite State Automaton Input Word Input Alphabet 
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.
    K. Inoue, I. Takanami, A. Nakamura and T. Ae, One-Way Simple Multihead Finite Automata, Theoret. Comput. Sci. 9 (1979), 311–328.MathSciNetCrossRefGoogle Scholar
  2. 2.
    O. H. Ibarra, A Note On Semilinear Sets And Bounded-Reversal Multihead Pushdown Automata, Information Processing Lett. 3 (1974), 25–28.MathSciNetCrossRefGoogle Scholar
  3. 3.
    O. H. Ibarra, S.K. Sahni and C.E. Kim, Finite Automata with Multiplication, Theoret. Comput. Sci. 2 (1976), 271–294.MathSciNetCrossRefGoogle Scholar
  4. 4.
    O. H. Ibarra and C. E. Kim, A Useful Device For Showing The Solvability Of Some Decision Problems, J. Comput. System. Sci. 13 (1976), 153–160.MathSciNetCrossRefGoogle Scholar
  5. 5.
    T.F. Piatkowski, N — head finite state machines, Ph. D. Dissertation, University of Michigan 1963.Google Scholar
  6. 6.
    A. I. Rosenberg, On multihead finite automata, IBM J. R. and D. 10 (1966), 388–394.CrossRefGoogle Scholar
  7. 7.
    A. L. Rosenberg, Nonwriting extensions of finite automata, Ph. D. Dissertation, Harward University (1965).Google Scholar
  8. 8.
    R. W. Floyd, Review 14, 353 of above paper by Rosenberg, Computing Review 9 (1968), 280.MathSciNetGoogle Scholar
  9. 9.
    I. H. Sudborough, One-way multihead writing finite automata, Information and Control 30 (1976), 1–20.MathSciNetCrossRefGoogle Scholar
  10. 10.
    J. Hromkovic, Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata, in Proceedings of the 10th International Symposium MFC`S81, Lecture Notes in Computer Science 118, Springer Verlag 1981, 304–313.Google Scholar
  11. 11.
    A. C. Yao and R. L. Rivest, K+1 heads are better then K, Journal of ACM 25 (1978), 337–340.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Pavol Ďuriš
    • 1
  • Juraj Hromkovič
    • 2
  1. 1.Computing CentreSlovak Academy of SciencesBratislavaCzechoslovakia
  2. 2.Department of Theoretical CyberneticsKomensky UniversityBratislavaCzechoslovakia

Personalised recommendations