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
A succinct canonical register automaton model for data domains with binary relations
TL;DR: A construction of succinct canonical register automata, which is parameterized on the set of relations by which elements in the data domain can be compared, and a Myhill Nerode-like theorem, from which minimal canonical automata can be constructed.
Journal ArticleDOI
A General Framework for the Derivation of Regular Expressions
TL;DR: A theoretical framework that allows us to perform the computation of regular expression derivatives through a space of generic structures and it is shown how to construct an alternating automaton associated with the derivation of a regular expression in this general framework.
Inference of regular languages using model simplicity
TL;DR: Experiments show that this approach produces satisfactory results when positive examples only are given, and can be helpful when only a limited number of negative examples is available, and suggest that improved algorithms will be needed in order to tackle more challenging problems.
Book ChapterDOI
A Minimized Assumption Generation Method for Component-Based Software Verification
TL;DR: The key idea of this method is finding the minimal assumptions in the search spaces of the candidate assumptions, seen as the environments needed for the components to satisfy a property and for the rest of the system to be satisfied.
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.