Skip to main content
SpringerLink
Log in

The wreath product and its applications

  • Mathematical Foundations Of The Theory Of Automata
  • Conference paper
  • First Online:
Formal Properties of Finite Automata and Applications (LITP 1988)

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

Included in the following conference series:

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

  1. J. A. Brzozowski and I. Simon, ‘Characterizations of locally testable events', Discrete Math. 4, (1973), 243–271.

    Article  Google Scholar 

  2. S. Eilenberg, Automata, Languages and Machines, vol. B., Academic Press, New York, 1976.

    Google Scholar 

  3. K. Krohn and J. Rhodes, ‘Algebraic decomposition theory of machines I', Transactions Amer. Math. Soc. 116, (1965), 450–464.

    Google Scholar 

  4. A. Meyer, ‘A note on star-free events', J. Assoc. Comput. Mach. 16, (1969), 220–225.

    Google Scholar 

  5. R. McNaughton and S. Papert, Counter-free Automata, MIT Press, Cambridge, Mass., 1971.

    Google Scholar 

  6. J. E. Pin, H. Straubing and D. Thérien ‘Locally trivial categories and unambiguous concatenation', Journal of Pure and Applied Algebra 52 (1988) 297–311.

    Google Scholar 

  7. J. Rhodes and B. Tilson, ‘The kernel of a monoid morphism: a reversal-invariant decomposition theory', Center for Pure and Applied Mathematics Research Report, University of California, Berkeley (1987).

    Google Scholar 

  8. M. P. Schtzenberger, ‘On finite monoids having only trivial subgroups', Information and Control 8, (1965), 190–194.

    Article  Google Scholar 

  9. P. Stiffler, ‘Extension of the fundametal theorem of finite semigroups', Advances in Math. 11, (1973), 159–209.

    Article  Google Scholar 

  10. H. Straubing, ‘Families of recognizable sets corresponding to certain varieties of finite monoids', J. Pure and Applied Algebra 18 (1979), 319–327.

    Article  Google Scholar 

  11. H. Straubing, ‘Aperiodic morphisms and the concatenation product of recognizable sets', Journal of Pure and Applied Algebra 15 (1979), 319–327.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Boston College, 02167, Chestnut Hill, Massachusetts, USA

    Howard Straubing

Authors
  1. Howard Straubing
    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

Straubing, H. (1989). The wreath product and its applications. 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/BFb0013108

Download citation

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

  • 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