Skip to main content
SpringerLink
Log in

One more property of array languages

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

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

  • 144 Accesses

Abstract

We exhibit an array language which is accepted by a non-deterministic finite automaton A /without pebbles/ and which is logspace complete for the class of array languages accepted by Turing machines in logarithmic space. It follows, that if there exists any deterministic automaton with a finite number of pebbles which accepts the same language as O-pebble automaton A then NL = L.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, M. and C. Hewitt: Automata on 2-dimensional tape. — In: Proc. 8 th IEEE Symp. Switching Theory, 1967, 155–160.

    Google Scholar 

  2. Cook, C. R. and P. S. P. Wang: A Chomsky hierarchy of isotonic array grammars and languages. — In: Comp. Graphics Image Processing 8, 1978, 144–152.

    Google Scholar 

  3. Ejsmont, M.: Problems in labyrinth decidable by pebble automata. Elektron. Informationsverarb. u. Kybernetik 12 (1984), 623–632.

    Google Scholar 

  4. Ejsmont, M.: Array languages acceptable in logarithmic space. submitted to Information and Control, 1984.

    Google Scholar 

  5. Jones, N. D.: Space bounded reducibility among combinatorial problems. J. Comput. System Sci. 11 (1975), 62–85.

    Google Scholar 

  6. Miligram, D. L. and A. Rosenfeld: Array automata and array grammars. — In: Proc. IFIP Congres 71, Ljubljana, Yugosl., Aug. 23–28, 1971. — Amsterdam: North-Holland Pub. Comp., 1972, 166–173.

    Google Scholar 

  7. Rosenfeld, A.: Some notes on finite-state picture languages. Inform. Control 29 (1976), 177–184.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Applied Physics and Mathematics, Technical University of Gdańsk, 80-952, Gdansk, Poland

    Marek Ejsmont

Authors
  1. Marek Ejsmont
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ejsmont, M. (1986). One more property of array languages. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation