Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1982: Automata, Languages and Programming pp 176–186Cite as

Multihead finite state automata am concatenation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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 Uk ℒ(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.

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. K. Inoue, I. Takanami, A. Nakamura and T. Ae, One-Way Simple Multihead Finite Automata, Theoret. Comput. Sci. 9 (1979), 311–328.

    Article  MathSciNet  Google Scholar 

  2. O. H. Ibarra, A Note On Semilinear Sets And Bounded-Reversal Multihead Pushdown Automata, Information Processing Lett. 3 (1974), 25–28.

    Article  MathSciNet  Google Scholar 

  3. O. H. Ibarra, S.K. Sahni and C.E. Kim, Finite Automata with Multiplication, Theoret. Comput. Sci. 2 (1976), 271–294.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  5. T.F. Piatkowski, N — head finite state machines, Ph. D. Dissertation, University of Michigan 1963.

    Google Scholar 

  6. A. I. Rosenberg, On multihead finite automata, IBM J. R. and D. 10 (1966), 388–394.

    Article  Google Scholar 

  7. A. L. Rosenberg, Nonwriting extensions of finite automata, Ph. D. Dissertation, Harward University (1965).

    Google Scholar 

  8. R. W. Floyd, Review 14, 353 of above paper by Rosenberg, Computing Review 9 (1968), 280.

    MathSciNet  Google Scholar 

  9. I. H. Sudborough, One-way multihead writing finite automata, Information and Control 30 (1976), 1–20.

    Article  MathSciNet  Google Scholar 

  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. A. C. Yao and R. L. Rivest, K+1 heads are better then K, Journal of ACM 25 (1978), 337–340.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Centre, Slovak Academy of Sciences, 842 35, Bratislava, Czechoslovakia

    Pavol Ďuriš

  2. Department of Theoretical Cybernetics, Komensky University, 842 15, Bratislava, Czechoslovakia

    Juraj Hromkovič

Authors
  1. Pavol Ďuriš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juraj Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ďuriš, P., Hromkovič, J. (1982). Multihead finite state automata am concatenation. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012767

Download citation

  • DOI: https://doi.org/10.1007/BFb0012767

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation