Codification schemes and finite automata
✍ Scribed by Penélope Hernández; Amparo Urbano
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 622 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0165-4896
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
Motivated by recent applications of ÿnite automata to theoretical physics, we study the minimization problem for nondeterministic automata (with outputs, but no initial states). We use Ehrenfeucht-Fra sse-like games to model automata responses and simulations. The minimal automaton is constructed an