Skip to main content
SpringerLink
Log in

Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten

  • Automatentheorie
  • Conference paper
  • First Online:
GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen

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

  • 1645 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.

Literatur

  1. ARBIB, M.A., GIVE'ON, Y.: Algebra Automata I: Parallel Programming as a Prolegomenon to the Categorical Approach Information and Control 12, 331–345; 1968

    Google Scholar 

  2. ECKER, K.: Das Transitionsmonoid bei der Parallelkomposition von endlichen Automaten Lecture Notes in Economics and Mathematical Systems 78, 56–62; 1973

    Google Scholar 

  3. HELTON, F.J.: Algebra Automata, Stack Automata, and Operator Semigroups Ph. D. thesis, Dpt. of Mathematics, Stanford University; 1969

    Google Scholar 

Download references

Authors
  1. D. Schütt
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Schütt, D. (1973). Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039142

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation