Skip to main content
SpringerLink
Log in

On a group-matrix type automaton with output

  • Published:
Acta Mathematica Hungarica 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

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. B. H. Barnes, Groups of automorphisms and sets of equivalence classes of input for automata,J.ACM.,12 (1965), 561–565.

    Google Scholar 

  2. B. H. Barnes, On the group of automorphisms of strongly connected automata,Math. Systems Theory,4 (1970), 289–294.

    Google Scholar 

  3. G. Feichtinger, Some results on the relation between automata and their automorphism groups,Computing,1 (1966), 327–340.

    Google Scholar 

  4. A. C. Fleck, Isomorphism groups of automata,J.ACM.,9 (1962), 469–476.

    Google Scholar 

  5. S. Ginsburg,An Introduction to Mathematical Machine Theory, Addison-Wesley (Reading, Massachusetts, 1962).

    Google Scholar 

  6. M. Ito, A representation of strongly connected automata and its applications,J. Comput. System Sci.,17 (1978), 65–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, University College of Science, 92, A.P.C. Road, 70009, Calcutta, India

    A. Sengupta

Authors
  1. A. Sengupta
    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

Sengupta, A. On a group-matrix type automaton with output. Acta Math Hung 48, 347–352 (1986). https://doi.org/10.1007/BF01951360

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation