Skip to main content
SpringerLink
Log in

Linear regular sets

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The purpose of this paper is to give a characterization of the sets of words accepted by finite linear automata. Since every linear automaton is isomorphic to a parallel product of a nilpotent linear automaton and a nonsingular linear automaton, our characterization is presented for these two classes of automata.

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

References

  1. Ecker, K., Ratschek, H.: Eigenschaften der von linearen Automaten erkennbaren Worte. Acta Informat. 3, 365–383 (1974)

    Google Scholar 

  2. Herman, G.T.: Linear regular languages. Part I. Acta Cybernet. 1, 3–12 (1969)

    Google Scholar 

  3. Herman, G.T., Linear regular languages. Part II. Acta Cybernet. 1, 41–56 (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Texas A & M University, 77843, College Station, TX, USA

    C. J. Maxson

Authors
  1. C. J. Maxson
    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

Maxson, C.J. Linear regular sets. Acta Informatica 10, 203–208 (1978). https://doi.org/10.1007/BF00289156

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation