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
Inverse subsemigroups of finite index in finitely generated inverse semigroups
TL;DR: In this paper, the authors studied some aspects of Schein's theory of cosets for closed inverse subsemigroups of inverse semigroups and established an index formula for chains of sub-semig groups, and an analogue of M. Hall's Theorem on the number of coset of a fixed finite index.
Journal ArticleDOI
Reachability of a Class of Coupled Discrete Event Systems
L.E. Solé,F. Szigeti +1 more
TL;DR: Coupled discrete event systems are realized in a special form which facilitate to prove that certain point-wise local reachability of all subsystems implies reachable of the large system.
Journal ArticleDOI
On State-Space Representations of General Discrete-Time Dynamical Systems
Cristian R. Rojas,Pawe Wachel +1 more
TL;DR: In this article , it is shown that every non-autonomous, discrete-time, causal, time invariant system has a state-space representation, and its minimality is discussed.
Dissertation
DesCo: a Web-base Knowledge System for Descriptional Complexity of Formal Languages
TL;DR: DesCo, a web-based knowledge system for descriptional complexity results, was created to compensate for this, as well as to provide some features that could be of help to the researchers, when looking for new results.
Journal ArticleDOI
Bounded memory in a changing world: Biases in behaviour and belief
TL;DR: In this article , a decision-maker faces a decision problem to choose an action, at a randomly determined time, to match an unknown state of nature in a Markov chain.
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.