Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1984: STACS 84 pp 299–304Cite as

Algebraic and topological theory of languages and computation

Part I: Theorems for arbitrary languages generalizing the theorems of eilenberg, kleene, schützenberger and straubing

  • Contibuted Papers
  • Conference paper
  • First Online:

  • 108 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Algebraic theory of Machines, Languages and Semigroups, ed. M.A. Arbib, Academic Press, N.Y., 1968.

    Google Scholar 

  2. Berstel, J. Transductions and Content-Free Languages, Teubner Studienbucker Informatick, 1979.

    Google Scholar 

  3. Birget, J-C and J. Rhodes, Almost Finite Expansions of Arbitrary Semigroups, Center for Pure and Applied Mathematics, U.C. Berkeley.

    Google Scholar 

  4. Burnside Groups, ed. J.L. Menicke, Springer-Verlag Lecture Notes in Mathematics, #806, 1980.

    Google Scholar 

  5. Clifford, A.H. and G.B. Preston, The Algebraic Theory of Semigroups, Vol. 1 and 2, American Mathematical Society, Mathematical Surveys, 7 1961 and 1967.

    Google Scholar 

  6. Eilenberg, S., Automata, Languages and Machines, Vol. B, Academic Press, 1976.

    Google Scholar 

  7. Hopcroft, J. and J. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, 1969.

    Google Scholar 

  8. Karp, R. Some Bounds on the Storage Requirements of a Sequential Machines and Turing Machinery, 478–489. Journal of the Association for Computing Machines, Vol. 14, 1967.

    Google Scholar 

  9. Kelley, J., General Topology, D. Van Nostrand, N.Y., 1955.

    Google Scholar 

  10. Lallement, G., Semigroups and Combinatorial Applications, Wiley, N.Y. 1979.

    Google Scholar 

  11. Moore, E.F., Sequential Machine: Selected Papers by Arthur W. Burke and Others, Addison-Wesley, Reading, MA 1964.

    Google Scholar 

  12. Rhodes, J., Infinite Iteration of Matrix Semigroups Part I: Structure Theorem for Torsion Semigroups, Center for Pure and Applied Mathematics, U.C. Berkeley.

    Google Scholar 

  13. —, Infinite Iteration of Matrix Semigroups Part II: Structure Theorem for Arbitrary Semigroups up to Aperiodic Morphisms, Center for Pure and Applied Mathematics, U.C. Berkeley.

    Google Scholar 

  14. Straubing, H., Families of recognizable sets corresponding to certain varieties of finite monoids, Journal of Pure and Applied Algebra, Vol. 15, 305–318, 1979.

    Google Scholar 

  15. —, Aperiodic Homomorphisms and the Concatenation Product of Recognizable Sets, Journal of Pure and Applied Algebra, Vol. 15, 319–327, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, 94720, Berkeley, CA

    John Rhodes

Authors
  1. John Rhodes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Fontet K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rhodes, J. (1984). Algebraic and topological theory of languages and computation. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-12920-0_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38805-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation