Advertisement

Algebraic and topological theory of languages and computation

Part I: Theorems for arbitrary languages generalizing the theorems of eilenberg, kleene, schützenberger and straubing
  • John Rhodes
Contibuted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)

Keywords

Turing Machine Finite State Machine Machine Model Sequential Machine Finite Alphabet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A]
    Algebraic theory of Machines, Languages and Semigroups, ed. M.A. Arbib, Academic Press, N.Y., 1968.Google Scholar
  2. [B]
    Berstel, J. Transductions and Content-Free Languages, Teubner Studienbucker Informatick, 1979.Google Scholar
  3. [B-R]
    Birget, J-C and J. Rhodes, Almost Finite Expansions of Arbitrary Semigroups, Center for Pure and Applied Mathematics, U.C. Berkeley.Google Scholar
  4. [Bu]
    Burnside Groups, ed. J.L. Menicke, Springer-Verlag Lecture Notes in Mathematics, #806, 1980.Google Scholar
  5. [C+P]
    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. [Ei]
    Eilenberg, S., Automata, Languages and Machines, Vol. B, Academic Press, 1976.Google Scholar
  7. [H+U]
    Hopcroft, J. and J. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, 1969.Google Scholar
  8. [Gap]
    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. [K]
    Kelley, J., General Topology, D. Van Nostrand, N.Y., 1955.Google Scholar
  10. [L]
    Lallement, G., Semigroups and Combinatorial Applications, Wiley, N.Y. 1979.Google Scholar
  11. [Mo]
    Moore, E.F., Sequential Machine: Selected Papers by Arthur W. Burke and Others, Addison-Wesley, Reading, MA 1964.Google Scholar
  12. [I]
    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. [II]
    , 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. [St. 1]
    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. [St. 2]
    —, Aperiodic Homomorphisms and the Concatenation Product of Recognizable Sets, Journal of Pure and Applied Algebra, Vol. 15, 319–327, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • John Rhodes
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaBerkeley

Personalised recommendations