Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1975: Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 pp 445–449Cite as

A hierarchy of regular sequence sets

  • Communications
  • Conference paper
  • First Online:

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

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. Staiger, L. and Wagner, K., Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. Elektronische Informationsverarbeitung und Kybernetik, EIK 10 (1974) 7, 379–392.

    Google Scholar 

  2. Müller, D.E., Infinite sequences and finite machines. AIEE Proc. Fourth Annual Symp. Switching Circuit Theory and Logical Design, 3–16.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Friedrich-Schiller-Universität Jena, Jena, DDR

    Klaus Wagner

Authors
  1. Klaus Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagner, K. (1975). A hierarchy of regular sequence sets. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_231

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_231

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation