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
Subpath Queries on Compressed Graphs: A Survey
TL;DR: For a survey of the main landmarks of the fascinating journey that took us from suffix trees to today's compressed indexes for labeled graphs and regular languages, see, e.g., as mentioned in this paper.
Journal ArticleDOI
Growth rates of permutation classes: Categorization up to the uncountability threshold
Jay Pantone,Vincent Vatter +1 more
TL;DR: In this paper, it was shown that ξ is the least accumulation point from above of growth rates and that all growth rates less than or equal to ξ are achieved by finitely based classes.
Posted Content
MSOL-definability equals recognizability for Halin graphs and bounded degree $k$-outerplanar graphs
Lars Jaffke,Hans L. Bodlaender +1 more
TL;DR: For graphs of bounded treewidth, it was shown in this paper that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time.
Journal ArticleDOI
Time-varying linear sequential machines. I
TL;DR: A time-varying linear sequential machine model is considered which hasthe property that the dimensionality of the system is a function of time and it is shown that every TVLSM has a minimal form unique up to isomorphism.
Journal ArticleDOI
Coalgebraic Quantum Computation
TL;DR: In this paper, a coalgebraic representation of systems occuring in the field of quantum computation, using convex sets of density matrices as state spaces, is presented, which can be used to convert quantum mechanical systems into simpler probabilistic systems with the same behaviour.
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.