Skip to main content
SpringerLink
Log in

Factorization of scott-style automata

  • Submitted Abstract
  • Conference paper
  • First Online:
Category Theory Applied to Computation and Control

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

  • 2027 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

  • Ginsburg, Seymour, and Sheila Greibach (1969). Abstract families of languages. American Mathematical Society, Memoir 87, pp. 1:32.

    MathSciNet  Google Scholar 

  • Scott, Dana (1967). Some definitional suggestions for automata theory. Journal of Computer and System Sciences, v. 1., pp. 187:212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, University of British Columbia, V6T 1W5, Vancouver, British Columbia, Canada

    John L. Baker

Authors
  1. John L. Baker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernest Gene Manes

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baker, J.L. (1975). Factorization of scott-style automata. In: Manes, E.G. (eds) Category Theory Applied to Computation and Control. Lecture Notes in Computer Science, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07142-3_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-07142-3_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37426-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation