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 Teachers’ Crowd: The Impact of Distributed Oracles on Active Automata Learning
TL;DR: This paper addresses the major bottleneck of active automata learning, the typically huge number of required tests, by investigating the impact of using a distributed testing environment (a crowd of teachers) to execute test cases in parallel.
Journal ArticleDOI
A Geometrical View of the Determinization and Minimization of Finite-State Automata *
TL;DR: It is shown that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations.
Journal ArticleDOI
Algebra and Language Theory
TL;DR: In the early days of high-speed computers there was a hope that it would be possible to program a computer to translate from one language to another, and this led to an intensive study of language structure as discussed by the authors.
Journal ArticleDOI
Asynchronous automata versus asynchronous cellular automata
TL;DR: It is shown that for every concurrent alphabet with nontransitive dependency relation, there exists a trace language accepted by infinitely many minimal nonisomorphic asynchronous automata.
Journal ArticleDOI
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
Thomas Place,Marc Zeitoun +1 more
TL;DR: In this article, the authors investigated quantifier alternation hierarchies in first-order logic on finite words and proved that one can decide membership of a regular language in the levels BΣ2 (finite Boolean combinations of formulas having only one alternation) and Σ3 (formulas having only two alternations and beginning with an existential block).
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.