A. C. Fleck
- 1 FLECK, A.C. Isomorphism groups of automata. J. ACM 9, 4 (Oct. 1962), 469476. Google Scholar
- 2 WEEG, G. P. The group and semigroup associated with automata. Proc. Syrup. Math. Theory Automata, pp. 257-266. Polytechnic Press, 1962.Google Scholar
- 3 CLIFFORD, A. i ., AND PRESTON, G.B. The Algebraic Theory of Seemi-Groups. Math. Surveys No. 7, Amer. Math. Soc., Providence, R. I., 1961.Google Scholar
- 4 RABIN, M. O., AND SCOTT, D. Finite automata and their decision problems. IBM J. Res. Develop. 8, (Apr. 1959), 114-125.Google Scholar
- 5 HARTXMANS, J. Loop-free structure of sequential machines. Inform. Contr. 5, 1 (Mar. 1962), 25-43.Google Scholar
Index Terms
- On the Automorphism Group of an Automaton
Recommendations
Kirkman triple systems of order 21 with nontrivial automorphism group
There are 50,024 Kirkman triple systems of order 21 admitting an automorphism of order 2. There are 13,280 Kirkman triple systems of order 21 admitting an automorphism of order 3. Together with the 192 known systems and some simple exchange operations, ...
On the automorphism group of a reduced automaton
SWAT '66: Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)In this paper we shall investigate the automorphism group G(A/H) of the reduced automaton A/H where A = (S, I, M) is a finite strongly connected automaton and H is a subgroup of the automorphism group G(A) of the automaton A. This problem and other ...
Characterization of the automorphism group of quaternary linear Hadamard codes
A quaternary linear Hadamard code $${\mathcal{C}}$$ is a code over $${\mathbb{Z}_4}$$ such that, under the Gray map, gives a binary Hadamard code. The permutation automorphism group of a quaternary linear code $${\mathcal{C}}$$ of length n is defined as $${{\rm PAut}(\mathcal{C}) = \{\sigma \in S_{n} : \sigma(\mathcal{C}) = \mathcal{C}\}}$$ . In this paper, the order of the permutation ...
Comments