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
Dissertation
Inférence automatique de modèles d'applications Web et protocoles pour la détection de vulnérabilités
TL;DR: Dans le cadre du projet SPaCIoS, l'objectif est de fournir un outil d'inference automatique de modele pour les applications Web ainsi que des methodes de detection de vulnerabilites a partir of ce modele.
Posted Content
A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages
TL;DR: The main result is a generalization of the classical Myhill-Nerode theorem to this symbolic setting and provides a foundation for grey-box learning algorithms in settings where the constraints on data parameters can be extracted from code using e.g. tools for symbolic/concolic execution or tainting.
Posted Content
Minimization and Canonization of GFG Transition-Based Automata.
Bader Abu Radi,Orna Kupferman +1 more
TL;DR: In this article, a polynomial minimization algorithm for GFG co-Buchi word automata with transition-based acceptance is presented, where a run is accepted if it traverses a set of designated transitions only finitely often.
Introducing process mining for AECFM: Three experimental case studies
TL;DR: This paper introduces process mining by presenting three experimental case studies which are conducted in order to study the applicability of process mining in the AECFM to provide useful insight and potential applications.
Proceedings ArticleDOI
How to Play Optimally for Regular Objectives?
TL;DR: This paper studies two-player zero-sum games played on graphs and makes contributions toward the following question: given an objective, how much memory is required to play optimally for that objective?
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.