scispace - formally typeset
Open AccessJournal ArticleDOI

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 satisfying

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Hierarchical Control of Discrete-Event Systems

TL;DR: A general version of Zhong's hierarchical consistency is established by first achieving control consistency — preservation of control structures through the aggregation mapping in a two-level hierarchy.
Journal ArticleDOI

Complete inverted files for efficient text retrieval and analysis

TL;DR: Using techniques from the theory of finite automata and the work on suffix trees are used to build a deterministic finite automaton that recognizes the set of all subwords of the set S, a data structure that is smaller and more flexible than the suffix tree is given.
Journal ArticleDOI

Minimal NFA problems are hard

TL;DR: The following basic minimization problem is studied: Given a DFA (deterministic FA), find a minimum equivalent FA (FA) that is Turing-complete and Turing-supervised.
Book

Introduction to Languages and the Theory of Computation

TL;DR: In this paper, an introduction for undergraduates to the theory of computation is given, which emphasizes formal languages, automata and abstract models of computation, and computability. But it also includes an introduction to computational complexity and NP-completeness.
Book

Time-Varying Systems and Computations

TL;DR: In this article, the authors present an overview of the history of non-uniform spaces in the Hilbert space, including inner-outer and inner-outer factorization, J-Unitary operators, and lossless Cascade Factorization.
References
More filters
Book ChapterDOI

Representation of Events in Nerve Nets and Finite Automata

S. C. Kleene
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.