Skip to main content
SpringerLink
Log in

W-automata and their languages

  • Invited Lecturers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

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

  • 157 Accesses

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. F. Bartholomes, G. Hotz, Homomorphismen und Reduktionen linearer Sprachen, Lecture Notes in Operations Res. and Math. Systems 32, Springer-Verlag, Berlin 1970

    Google Scholar 

  2. W. Brauer, Automatentheorie, Teubner Verlag, Stuttgart, in preparation

    Google Scholar 

  3. P. Cartier, D. Foata, Problèmes combinatoires de commutation et réarrangements, Lect. Notes in Math. 85, Springer-Verlag, Berlin 1969

    Google Scholar 

  4. K. Čulik, I. Havel, On multiple finite automata, in W. Händler, E. Peschl, H. Unger, 3. Colloquium über Automatentheorie, 19.-22-10. 1965, Birkhäuser, Basel, 1967

    Google Scholar 

  5. Y.A.Dikovskii, A Note on Deterministic Linear Languages, Systems Theory Research, A Translation of Problemy Kibernetiki 23, Novosibirsk 1972, pp. 295–300

    Google Scholar 

  6. M. Fliess, Matrices de Hankel, J.Math. pures et appl. 53, 1974, pp. 197–222

    Google Scholar 

  7. C. Hoffmann-Walter, Deterministische Zwei-Band-Automaten und Eindeutigkeit linearer Sprachen, Diploma Thesis, Inst.f.Inf. Univ. Hamburg, Dec. 1975

    Google Scholar 

  8. R. Kurki-Suonio, Describing Automata in Terms of Languages Associated with Their Peripheral Devices, Computer Sc.Dept., Stanford Univ., Techn. Rpt. STAN-CS-75-493, May 1975

    Google Scholar 

  9. M. Lahnstein, Keller-Stack-Automaten und indizierte parallele Sprachen, Diploma Thesis, Inst.f.Inf. Univ. Hamburg, to be published as Techn. Rpt. IFI-HH-B, 1976

    Google Scholar 

  10. M.Opp, Charakterisierungen erkennbarer Termmengen in absolut freien universellen Algebren, Doctoral Dissertation, Inst.f.Inf. Univ. Hamburg, Techn. Rpt. IFI-HH-B-20/76, Feb. 1976

    Google Scholar 

  11. R.D. Rosebrugh, D. Wood, Restricted parallelism and right linear grammars, Utilitas Math. 7, 1975, pp. 151–186

    Google Scholar 

  12. A. Salomaa, Formal Languages, Academic Press, New York, 1973

    Google Scholar 

  13. C.-P. Schnorr, Freie assoziative Systeme, EIK 8, 1967, pp. 319–340

    Google Scholar 

  14. A. Salomaa, Theory of Automata, Pergamon Press, Oxford, 1969

    Google Scholar 

  15. J.M.Smith, Monoid Acceptors and Their Relation to Formal Languages, Ph.D. Dissertation, Univ. of Pennsylvania, 1972

    Google Scholar 

  16. W.J. Savitch, How to make arbitrary grammars look like context-free grammars, SIAM J. Comput. 2, 1973, pp. 174–182

    Article  Google Scholar 

  17. H.Vogel, Zur Theorie der rationalen und deterministischen Mengen, Diploma Thesis, Mitt. Ges. Math. Datenverarb. 18, Bonn. 1972

    Google Scholar 

  18. S.J.Walljasper, Non-deterministic automata and effective languages, Doctoral Thesis, Univ. of Iowa, AD-69 2421, 1969

    Google Scholar 

  19. G. Wechsung, Isomorphe Darstellungen der Kleeneschen Algebra der regulären Mengen, Mitt. Math. Ges. DDR, 1973, Nr.2/3, pp. 161–171

    Google Scholar 

  20. D. Wotschke, A characterization of Boolean closures of families of languages, in: Böhling, Indermark (eds.), 1. Fachtagung über Automatentheorie und formale Sprachen, Lect. Notes Comput. Sc. 2, Springer-Verlag, Berlin, 1973, pp. 191–200

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Hamburg, D-2000, Hamburg 13

    Wilfried Brauer

Authors
  1. Wilfried Brauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brauer, W. (1976). W-automata and their languages. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_158

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_158

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation