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
Recognizability in the Simply Typed Lambda-Calculus
TL;DR: A notion of recognizing sets of simply typed *** -terms that extends the notion of recognizable sets of strings or trees is defined that is based on finite models.
ProGram : a grammar-based method for specification and hardware synthesis of communication protocols
TL;DR: ProGram is a grammar-based method for specification and hardware synthesis of communication protocols and its application is to be investigated in the area of knowledge representation and semantics.
Journal ArticleDOI
A succinct canonical register automaton model
TL;DR: A novel canonical automaton model, based on register automata, that can be used to specify protocol or program behavior, and can be exponentially more succinct than previous proposals, since it filters out ‘accidental’ relations between data values.
Book ChapterDOI
Some Remarks on the Concept of State
TL;DR: In this article, a system which is subject to a succession of T inputs u1,u2,…,uT where u belongs to a given set Ut, for each t, is considered.
The Smallest Automaton Recognizing the Subwords of a Text ; CU-CS-300-84
TL;DR: It is demonstrated that the smallest partial DFA for the set of all subwords of a given word w, Iwl>2, has at most 21w(-2 states and 3(wl-4 transition edges, independently of the alphabet size).
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.