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
Critical Exponent of Infinite Balanced Words via the Pell Number System
TL;DR: In this paper, the smallest possible critical exponent of an infinite balanced word over a 5-letter alphabet is 3/2, using a formulation of first-order logic, the Pell number system, and a machine computation based on finite state automata.
Probabilistic Arithmetic Automata Applications of a Stochastic Computational Framework in Biological Sequence Analysis
TL;DR: A thorough derivation of a probabilistic model, called Probabilistic arithmetic automaton (PAA), which models sequences of operations associated to operands depending on chance and provides the computational framework to calculate the exact distribution of the value resulting from those operations.
Book ChapterDOI
The Work of Anil Nerode: A Retrospective
J. B. Remmel,J. N. Crossley +1 more
TL;DR: In this survey, Anil Nerode’s work divides into a number of periods though, inevitably, there are overlaps and cross-currents.
Dissertation
Language learning with correction queries
TL;DR: This dissertation thoroughly investigates a recently introduced, linguistic motivated, type of query called Correction Query (CQ), and considers three possible definitions, and gives necessary and sufficient conditions for a language class to be learnable with these types of queries.
Proceedings ArticleDOI
Some remarks on abstract machines
TL;DR: Much of the recent literature has dealt with questions almost exclusively of mathematical, as contrasted with engineering, interest, and the present paper is written in that spirit.
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.