The relationship between the structure of autonomous finite automata and their operation-preserving functions is considered. The results imply some ideas in the study of operation-preserving functions of arbitrary finite automata, because with each finite automaton the set of its autonomous factors
Finite Automata and Asser's Function Algorithms
β Scribed by Seiiti Huzino
- Publisher
- John Wiley and Sons
- Year
- 1962
- Tongue
- English
- Weight
- 149 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We rewrite some concepts in the theory of one-dimensional periodic cellular automata in the language of finite fields. The state space of an automaton with N cell and q = pZ possible values for each cell (p prime) is identified with the finite field of qU elements, represented by means of a normal b
An investigation is conducted of the Vapnik-Chervonenkis dimensions (VC-dimensions) of finite automata having k letters and n states. It is shown for a fixed positive integer k( 22) that (1) the VC-dimension of DFAk(n) := {Lc{1,2,...,k}\* : some deterministic finite automaton with at most n states a
An investigation is conducted of the Vapnik-Chervonenkis dimensions (VC-dimensions) of finite automata having k letters and n states. It is shown for a fixed positive integer k ( > 2), that (1) the VC-dimension of DFAk(n) := {L c{1,2,...,k}\* : some deterministic finite automaton with at most n stat