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
Posted Content
On Prefix-Sorting Finite Automata.
TL;DR: This paper provides several results showing that the problem of indexing graphs for efficient path queries becomes tractable on DFAs, and the minimization theorem essentially solves the deterministic-acyclic case with a solution of provably minimum size.
Journal ArticleDOI
Process Mining: Applied Discipline and Software Implementations
TL;DR: In this paper, Burattin et al. describe the digital footprint as a "digital footprint" of event logs, and show that event logs can be used for process mining.
Journal ArticleDOI
Using the past for resolving the future
TL;DR: A survey of history deterministic automata can be found in this paper , where history determinism is defined as the ability of an automaton with an infinite look ahead to resolve its nondeterministic choices in a way that only depends on the past.
Proceedings ArticleDOI
Residual Nominal Automata
Joshua Moerman,Matteo Sammartino +1 more
TL;DR: In this article, the authors develop the theory of canonical residual automata, a subclass of non-deterministic nominal automata with canonical representatives, which can always be constructed via a finite number of observations.
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.