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
Journal ArticleDOI
Learning with limited memory: Bayesianism vs heuristics
Kalyanmoy Chatterjee,Tai-Wei Hu +1 more
TL;DR: In this paper , the authors identify two features of the simplified analysis: information stickiness (ignoring information) and rule stickiness(ignoring small differences in the environment) and identify two simplifications in the analysis that enable them to obtain a satisfactory outcome.
Identification des langages rationnels à résiduels k-disjoints
Alain Terlutte,Fabien Torre +1 more
TL;DR: In this article, les familles de rationnels a residuels k-disjoints contient la famille correspondante de langages k-reversibles, and les possibilites d'identification of ces familles are presented.
Journal ArticleDOI
Infinitude of Primes Using Formal Languages
TL;DR: In this article, a certain class of formal languages, called regular languages, are discussed and a set of rules specific to them are defined. But they are not defined in this paper.
Journal ArticleDOI
B70-5 Theories of Abstract Automata
TL;DR: Professor Arbib has once more proven by producing a sound and scientifically precise book that is also a pleasure to read by producing That is why both nature and nurture are important.
Journal ArticleDOI
Duality of lattices associated to left and right quotients
TL;DR: In this article , the authors associate lattices to the sets of unions and intersections of left and right quotients of a regular language and give necessary and sufficient conditions for these lattice to have maximal possible complexity.
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.