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
A categorical approach to minimal realization for a fuzzy language
TL;DR: This study introduces categorical characterizations of a run map, reachability map, and observability map for a crisp deterministic fuzzy automaton and shows that all minimal realizations for a given fuzzy language are isomorphic to the Nerode realization for the same case.
Proceedings ArticleDOI
Sequential fuzzy system identification
TL;DR: The results obtained are a further step towards an integrated 'theory of uncertainty' and give new insights into problems of inductive reasoning and processes of 'precisiation', and have been embodied in a computer program that can be applied to the modelling of sequential fuzzy data.
Learning Component Behavior from Tests : Theory and Algorithms for Automata with Data
TL;DR: Behavioral models have many different usages, e.g., in model-based techniques for software development and ...
Book ChapterDOI
The average complexity of Moore's state minimization algorithm is O(n log log n)
TL;DR: It is proved that the average complexity, for the uniform distribution on complete deterministic automata, of Moore's state minimization algorithm is O(n log log n), where n is the number of states in the input automata.
Book ChapterDOI
Minimal and Reduced Reversible Automata
TL;DR: It is proved that if the minimum deterministic automaton accepting a reversible language contains a loop in the “irreversible part” then it is always possible to construct infinitely many reduced reversible automata accepting such a language.
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.