Skip to main content
SpringerLink
Log in

On the quasi-controllability of automata

  • Automata Theory
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

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

  • 2026 Accesses

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

References

  1. GRZYMALA-BUSSE,J.W. Subautomata of finite automata associated with the change of operating time. in Polish, Rep.46, Technical University of Poznan,1972.

    Google Scholar 

  2. GRZYMALA-BUSSE,J.W. On the finite non-annul semigroups. presented for publication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Control Engineering Technical University of Poznan, Poland

    L. Beyga

Authors
  1. L. Beyga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beyga, L. (1975). On the quasi-controllability of automata. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_663

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_663

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation