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
Bicategory-Theoretic Approach to Minimal Fuzzy Realization for Fuzzy Behavior
TL;DR: This work applies the bicategory-theoretic concepts in formation of minimal fuzzy realization for a given fuzzy behavior using the concept of derivative of fuzzy behavior.
Posted Content
Deciding Top-Down Determinism of Regular Tree Languages
Peter Leupold,Sebastian Maneth +1 more
TL;DR: For deterministic bottom-up tree automata, it was shown in this article that definability is decidable in quadratic time if a given tree language can be recognized by a top-down tree automaton.
Posted Content
Certifying DFA Bounds for Recognition and Separation
TL;DR: In this paper, the authors propose to use determinacy of turn-based two-player games with regular winning conditions to generate certificates for the number of states that a deterministic finite automaton (DFA) needs in order to recognize a given language.
Journal ArticleDOI
On Locally Minimum and Strongest Assumption Generation Method for Component-Based Software Verification
TL;DR: This paper presents a method to generate locally minimum and strongest assumptions for verification of component-based software by integrating a variant of membership queries answering technique to an algorithm which considers candidate assumptions that are smaller and stronger first, larger and weaker later.
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.