Linear automaton transformations
Anil Nerode
- Vol. 9, Iss: 4, pp 541-544
Reads0
Chats0
TLDR
For a finite commutative ring with unit the authors determine which linear transformations M: RN—+RN can be realized by finite automata.Abstract:
Let R be a nonempty set, let N consist of all non-negative rational integers, and denote by RN the set of all functions on N to R. If R is a ring, a map M: R"—>P^ is linear if M(rxfx+r2f2)=rx(Mfx) +r2(Mf2) for rx, r2 in R, fx, f2 in RN. For a finite commutative ring with unit we determine which linear transformations M: RN—+RN can be realized by finite automata. More precisely, let A, B he finite nonempty sets. A map M: AN—>BN is an automaton transformation if there exists a finite set Q, maps Mq: A X£>—><2, Mb: A XQ-*B, elements h in B, q in Q such that corresponding to each/ in AN there exists an h in QN satisfyingread more
Citations
More filters
Book ChapterDOI
Methods for specifying families of formal languages — past-present-future
TL;DR: The chapter discusses the different ways to describe the families of languages that are of interest to computer scientists, and the Intersection theorem is an indication towards determining appropriate families of language to study.
Dissertation
Algebraic verification of probabilistic and concurrent systems
TL;DR: This thesis has shown that the equational theory of continuous probabilistic Kleene algebra is complete with respect to an automata model under standard simulation equivalence and yields a minimisation-based decision procedure for the algebra.
Journal ArticleDOI
A Canonical Semi-Deterministic Transducer
TL;DR: In this paper, the existence of a canonical form for semi-deterministic transducers with sets of pairwise incomparable output strings is proved. But this form requires domain knowledge only and there is no learning algorithm that uses only domain knowledge.
Book ChapterDOI
Automata and Binary Decision Diagrams
TL;DR: In this paper, the authors show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant, which they call the "canonicity of decision diagrams".
References
More filters
Book ChapterDOI
Representation of Events in Nerve Nets and Finite Automata
TL;DR: This memorandum is devoted to an elementary exposition of the problems and of results obtained on the McCulloch-Pitts nerve net during investigations in August 1951.