Zobrazeno 1 - 6
of 6
pro vyhledávání: '"H. E. Pickett"'
Autor:
H. E. Pickett
Publikováno v:
Journal of the ACM. 14:382-388
If an automaton is strongly connected, all of its automorphisms are regular permutations. It is proved that given any two groups G and H of regular permutations on finite sets A and B , respectively, there exists strongly connected automata @@@@ and
Autor:
C. T. Long, M. V. Subbarao, Richard Williams, R. Kellner, V. O. S. Olunloyo, A. D. Weiss, H. E. Pickett, R. E. Dressler, T. V. Lakshminarasimhan, J. H. Hodges
Publikováno v:
The American Mathematical Monthly. 73:846-864
Autor:
H. E. Pickett
Publikováno v:
Mathematical Systems Theory. 4:357-372
A complete non-deterministic automaton may be viewed as a relational system with unary and binary relations. These relations must satisfy certain closure properties. On the basis of these properties, recent results concerning the representation of ge
Autor:
H. E. Pickett
Publikováno v:
Fundamenta Mathematicae. 56:223-240
Autor:
J. K. Goodwine, H. E. Pickett
Publikováno v:
SAE Technical Paper Series.
Autor:
H. E. Pickett
Publikováno v:
The American Mathematical Monthly. 73:860