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
Quotient Complexity of Regular Languages
TL;DR: The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented to help in the estimation of the upper bounds on quotient complexity of regular operations.
Book ChapterDOI
Partial Automata and Finitely Generated Congruences: An Extension of Nerode’s Theorem
TL;DR: In this paper, the authors define partial automata on a finite ranked alphabet and prove that the finitely generated congruences on T Σ are in one-to-one correspondence with the finite automata with no inaccessible and no inessential states.
Proceedings Article
Active Automata Learning: From DFAs to Interface Programs and Beyond
TL;DR: This paper reviews the development of active learning in the last decade under the perspective of treating of data, a major source of undecidability, and therefore a key problem to achieve practicality, and revisit different steps towards dealing with data explicitly in active learning.
Uniquely represented data structures with applications to privacy
Guy E. Blelloch,Daniel Golovin +1 more
TL;DR: This dissertation provides the theoretical foundation for the development of efficient uniquely represented systems that provably store exactly the information their designs specify, and nothing more.
Posted Content
Asymptotic enumeration of Minimal Automata
TL;DR: In this article, the authors determined the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial distribution over terminal states, with arbitrary parameter b.
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.