Skip to main content
Springer Nature Link
Log in

Non-deterministic two-tape automata are more powerful than deterministic ones

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

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

Included in the following conference series:

  • 144 Accesses

Abstract

Non-deterministic two-tape automata as defined by Elgot and Mezei are similar to non-deterministic finite state acceptors — instead of reading from one tape, they can read simultaneously from two tapes. They accept just the rational subsets of X* × Y*, and are closely related to linear context-free grammars. It is shown that, in contrast to the one-tape case, deterministic two-tape automata are less powerful than non-deterministic ones. The counterexample is closely related to a linear context-free language of unbounded degree of ambiguity.

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. Berstel, Jean: Transductions and Context-Free Languages, Teubner-Verlag, Stuttgart 1979.

    Google Scholar 

  2. Book, Ronald, V.: Remarks on linear context-free languages, EATCS Bulletin 10 (1980) 30–31.

    Google Scholar 

  3. Brandenburg, Franz-Josef: On FIFO and LIFO type languages, in Acted de L'Ecole de Printemps de Theorie des Languages, ed.: M. Blab, Muriol (1981), 193–201.

    Google Scholar 

  4. Brauer, Wilfried: W-automata and their languages, Proc MFCS '76, LNCS vol. 45 (1976) 12–22.

    Google Scholar 

  5. Brauer, Wilfried: Automatentheorie, Teubner-Verlag, Stuttgart, 1984.

    Google Scholar 

  6. Dikowskii, Y.A.: A note on deterministic linear languages, Systems Theory Research, Transl. of Problemy Kibernetiki 23 (1972) 295–300.

    Google Scholar 

  7. Eilenberg, S., Elgot, C.C., Shepherdson, J.C.: Sets recognized by n-tape automata, J. Algebra 13 (1969) 447–464.

    Google Scholar 

  8. Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata, IBM J. Develop. 9 (1965) 47–68.

    Google Scholar 

  9. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.

    Google Scholar 

  10. Harrison, M.A.: Introduction to Formal Language Theory, Addison-Wesley, 1978.

    Google Scholar 

  11. Nivat, M.: Transductions des langages de Chomsky, Thèse d'Etat, Univ. de Paris, 1967, und in: Ann. de l'Inst. Fourier, Grenoble 18 (1968) 339–456.

    Google Scholar 

  12. Rabin, M.O., Scott, D.: Finite automata and their decision problems, IBM J. Research and Development 3, (1959), 114–125.

    Google Scholar 

  13. Rosenberg, A.: A machine realization of the linear context-free languages, Inf. & Control 10 (1967) 175–188.

    Google Scholar 

  14. Shamir, E.: Some inherently ambiguous context-free languages, Information and Control 18, (1971), 355–363.

    Google Scholar 

  15. Walljasper, S.J.: Non-Deterministic Automata and Effective Languages, Ph. D. Thesis, Univ. of Iowa, AD-69 2421, (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Schlüterstraße 70, 2000, Hamburg 13, West Germany

    W. Brauer & K. -J. Lange

Authors
  1. W. Brauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. -J. Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brauer, W., Lange, K.J. (1984). Non-deterministic two-tape automata are more powerful than deterministic ones. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023996

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics