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
DissertationDOI
Algebraic theory of minimal nondeterministic finite automata with applications
TL;DR: It is proved that an NFA recognizes a partial if its language extends the partial, meaning that the NFA’s behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language.
Journal ArticleDOI
Records of turing machines
TL;DR: These sequences of symbols of Σ that are records of computations of Turing machines are characterized, where Σ is a finite alphabet and c is the set of triples.
Lexical Rules in HPSG: What are they?
TL;DR: Lexical rules, or lexical redundancy rules as they’re often called, have played an important role in numerous computational linguistic systems, as well as in certain highly lexicalized theoretical grammar frameworks such as HPSG.
Journal ArticleDOI
The State of Dynamical Input)Output Systems as an Operator
TL;DR: In this paper, a causal input-output system operating for all time from the indefinite past to the indefinite future is described by a function space for inputs, an output space for outputs, and a causal operator mapping the input space into the output space.
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.