Group theoretic characterization of linear permutation automata
โ Scribed by J. Hartmanis; H. Walter
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 861 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we characterize all permutation automata which can be linearly realized over the field GF(p) in terms of the group generated by the automaton. From this group theoretic characterization of linear permutation automata we derive, among other results, a complete characterization of all homomorphisms of a linear automaton which yield linearly realizable image automata as well as several results about the structure of linear automata.
๐ SIMILAR VOLUMES
In this paper, we introduce a set E(f,) which consists of all points rEZ2 such that the composite map o'(&) of a shift transformation or and a parallel map fm is non-ergodic. We then show that the properties of parallel maps foe such as finite orderedness, infinite orderedness, injectivity, surjecti