Skip to main content
Springer Nature Link
Log in

A model for ergodic automorphisms on groups

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R. V. Book, S. A. Greibach andB. Wegbreit, Time and tape-bounded turing acceptors andAfl,J. Computer System Sciences 4 (1970), 606–621.

    Google Scholar 

  2. S. Ginsburg andJ. Goldstine, Intersection closed fullAfl and the recursively enumerable languages,Information and Control, to appear.

  3. S. Ginsburg andS. Greibach, Abstract families of languages,Memoirs Amer. Math. Soc. no. 87 (1969), pp. 1–32.

    Google Scholar 

  4. S. Ginsburg andS. Greibach, PrincipalAfl,J. Computer System Sciences 4 (1970), 308–338.

    Google Scholar 

  5. S. Ginsburg andM. Harrison, On the closure ofAfl under reversal,Information and Control 17 (1970), 395–409.

    Google Scholar 

  6. S. Ginsburg andJ. Hopcroft, Images ofAfl under certain families of homomorphisms,Math. Systems Theory 5 (1971), 216–227.

    Google Scholar 

  7. S. Ginsburg andG. F. Rose, On the existence of generators for certainAfl,Information Sciences 2 (1970), 431–446.

    Google Scholar 

  8. S. Ginsburg andE. H. Spanier, Substitutions in families of languages,Information Sciences 2 (1970), 83–110.

    Google Scholar 

  9. J. Goldstine, Substitution and bounded languages,J. Computer System Sciences 6 (1972), 9–29.

    Google Scholar 

  10. S. Greibach, Chains of fullAfl,Math. Systems Theory 4 (1970), 231–242.

    Google Scholar 

  11. S. Greibach andS. Ginsburg, Multitapeafa,J. Assoc. Comput. Mach., to appear.

  12. David L. Lewis, Closure of families of languages under substitution operators,2nd Annual Symposium on Theory of Computing, Northhampton, Mass., 1970, pp. 100–108.

  13. J. S. Ullian, Three theorems concerning principalAfl,J. Computer System Sciences 5 (1971), 304–314.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oregon State University, 97331, Corvallis, Oregon, USA

    James R. Brown

Authors
  1. James R. Brown
    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

Brown, J.R. A model for ergodic automorphisms on groups. Math. Systems Theory 6, 235–242 (1972). https://doi.org/10.1007/BF01706092

Download citation

  • Received:

  • Issue Date:

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

Keywords