Advertisement

On the periodic sum and extensions of finite automata

  • Jerzy W. Grzymala-Busse
Automata Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 28)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    BAVEL, Z.: Structure and transition-preserving function of finite automata. J. Assoc. Comput. Mach. 15, 1 (1968), 135–158.Google Scholar
  2. [2]
    FLECK, A.C.: Isomorphism groups of automata. J. Assoc. Comput. Mach. 9, 4 (1962), 469–476.Google Scholar
  3. [3]
    GILL, A.: Time-varying sequential machines. J. Franklin Inst. 276, 6 (1963), 519–539.Google Scholar
  4. [4]
    GRZYMALA-BUSSE, J.W.: Automorphisms of polyadic automata. J. Assoc. Comput. Mach. 16, 2 (1969), 208–219. Err.:646.Google Scholar
  5. [5]
    —: On the periodic representations and the reducibility of periodic automata. J. Assoc. Comput. Mach. 16, 3 (1969), 432–441. Err.: 17, 4 (1970), 739.Google Scholar
  6. [6]
    —: Periodic representations and T-partitionable equivalents of sequential machines. IEEE Trans. Computers C-20, 2 (1971), 190–198.Google Scholar
  7. [7]
    WEEG, G.P.: The structure of an automaton and its operation-preserving transformation group. J. Assoc. Comput. Mach. 9, 3 (1962), 345–349.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Jerzy W. Grzymala-Busse
    • 1
  1. 1.Institute of Control EngineeringTechnical University of PoznanPoland

Personalised recommendations