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
A taxonomy of finite automata minimization algorithms
TL;DR: This paper presents a taxonomy of nite automata minimization algorithms and shows that the equivalence relation is the greatest xed point of an equation providing a useful characterization of the required computation.
Proceedings ArticleDOI
Automata learning with automated alphabet abstraction refinement
TL;DR: This paper introduces a method for refining a given abstraction to automatically regain a deterministic behavior on-the-fly during the learning process, with the effect that detected nondeterminism does not lead to failure, but to a dynamic alphabet abstraction refinement.
Journal ArticleDOI
Generalizations of regular sets and their application to a study of context-free languages*
TL;DR: Using the subclass of CF languages defined over paired alphabets, this work proves a refinement of the well-known Chomsky—Schutzenberger Theorem, and also proves that the decision procedure for parenthesis Grammars can be extended to a broader class of CF grammars.
Book ChapterDOI
Residual Finite State Automata
TL;DR: In this article, the authors define a new variety of Nondeterministic Finite Automata (NFA): a Residual Finite State Automaton (RFSA) is an NFA all the states of which define residual languages of the language L that it recognizes; a residual language according to a word u is the set of words v such that uv is in L.
Book ChapterDOI
Congruences for visibly pushdown languages
TL;DR: Though Vpls in general do not have unique minimal automata, this work considers a subclass of VPAs called k-module single-entry VPAs that correspond to programs with recursive procedures without input parameters, and shows that the class of well-matched VPLs do indeed haveunique minimal k- module single- entry automata.
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.