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
The Role of Finite Automata in the Development of Modern Computing Theory
TL;DR: The essence of the development of regular patterns described by finite automata is illustrated by following the mainstream of work flowing from Kleene's 1951 theorem on regular events to recent results in computational complexity and algorithmic logic.
Book ChapterDOI
Active Mining of Document Type Definitions
Markus Frohme,Bernhard Steffen +1 more
TL;DR: The point of this specification mining approach is to reveal unknown (lost or hidden) syntactic document constraints that are automatically imposed by document validators in order to support document writers or to validate whether a certain validator implementation does indeed satisfy its specification.
Book ChapterDOI
NFA to DFA Transformation for Finite Languages
Kai Salomaa,Sheng Yu +1 more
TL;DR: In this paper, it was shown that O(2n/2) is the worst-case optimal upper bound on the number of states of a DFA that is equivalent to an n-state NFA accepting a finite language.
Posted Content
Growth rates of permutation classes: categorization up to the uncountability threshold
Jay Pantone,Vincent Vatter +1 more
TL;DR: In this paper, the authors provided a complete characterization of the growth rates less than a certain algebraic number, and showed that the growth rate of permutation classes less than this algebraic value is the least accumulation point from above of growth rates of finitely based classes.
Journal ArticleDOI
Analyzing program behavior through active automata learning
TL;DR: The objective of the RERS Challenge 2013 was to analyze program behavior with respect to given sets of LTL and reachability properties for a set of reactive programs, and the approach is presented, which is based on active automata learning.
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.