Skip to main content
SpringerLink
Log in

Semigroups of shift register counting matrices

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

This is a revised and corrected version of notes from lectures by Andrew Gleason. The goal of the paper is a structure theorem about “onto maps” from the space of infinite Boolean sequences to itself, induced by binary functions on a shift register. The methods of proof involve a close study of the semigroup of counting matrices.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

  1. Hedlund, G., Endomorphisms and automorphisms of the shift dynamical system,Mathematical Systems Theory, Vol. 3, No. 4, 1969, pp. 320–375.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Defense Analyses, 08540, Princeton, NJ, USA

    Andrew Gleason

Authors
  1. Andrew Gleason
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gleason, A. Semigroups of shift register counting matrices. Math. Systems Theory 25, 253–267 (1992). https://doi.org/10.1007/BF01213859

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation