Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1988: Formal Properties of Finite Automata and Applications pp 89–103Cite as

Automata and the word problem

  • Problems Related To The Theory Of Automata
  • Conference paper
  • First Online:

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

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. S.I. Adjan, Defining relations and algorithmic problems for groups and semigroups, Tr. Mat. Inst. Steklov 85, 1966(Russian): Am. Math. Soc. (transl.) 152, 1967.

    Google Scholar 

  2. J. Barwise, Handbook of Mathematical Logic, North Holland 1977.

    Google Scholar 

  3. M. Benois, Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris, Sér. A, 269 (1969), 1188–1190.

    Google Scholar 

  4. J. Berstel, Transductions and Context-free Languages, Teubner Studienbücher 1979.

    Google Scholar 

  5. G. Lallement, Semigroups and Combinatorial Applications, Wiley, 1979.

    Google Scholar 

  6. W. Magnus, Das Identitäts — Problem für Gruppen mit einer definierenden Relation, Math. Ann. 106, (1932), 295–307.

    Article  MathSciNet  Google Scholar 

  7. S.W. Margolis and J.C. Meakin, Inverse monoids, trees and context-free languages, Submitted for publication.

    Google Scholar 

  8. S.W. Margolis, J.C. Meakin and J.B. Stephen, Some decision problems for inverse monoid presentations, in "Semigroups and their applications", Goberstein, Higgins (Ed), D. Reidel, 1987, 99–110.

    Google Scholar 

  9. A.A. Markov, On the impossibility of certain algorithms in the theory of associative systems, Dokl. Akad. Nauk 55(1947), 587–590; II, 58(1947), 353–356 (Russian)

    Google Scholar 

  10. W.D. Munn, Free inverse semigroups, Proc. London Math. Soc. 30(1974), 385–404.

    Google Scholar 

  11. M. Petrich, Inverse Semigroups, Wiley, 1984.

    Google Scholar 

  12. E.L. Post, Recursive unsolvability of a problem of Thue, J. Symb. Logic 12(1947), 1–11.

    Google Scholar 

  13. M.O. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141(1969), 1–35.

    Google Scholar 

  14. M.O. Rabin, Automata on infinite objects and Church's problem, C.B.M.S. Regional Conf. Series in Math., No. 14(1971), Amer. Math. Soc.

    Google Scholar 

  15. J.B. Stephen, Applications of automata theory to presentations of monoids and inverse monoids, Ph.D. Thesis, Univ. of Nebraska, 1987.

    Google Scholar 

  16. J.B. Stephen, Presentations of inverse monoids, Submitted for publication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Nebraska, 68588, Lincoln, Nebraska, U.S.A.

    John Meakin

Authors
  1. John Meakin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. E. Pin

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meakin, J. (1989). Automata and the word problem. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013114

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46721-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation