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
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers
TL;DR: It is proved that probabilistic languages can have arbitrarily high deterministic state complexity and a lower bound technique relying on boundedly generated lattices of languages is devised, stating that there are languages of arbitrarily high polynomial alternating state complexity.
Posted Content
Certifying Inexpressibility
Orna Kupferman,Salomon Sickert +1 more
TL;DR: In this article, a game between Prover and Refuter is considered to decide whether a given language can be expressed by an automaton of a desired class, and a winning strategy for Refuter can serve as a simple and easy-tounderstand certificate to inexpressibility.
Proceedings Article
Good Old Fashioned Automata Theory and the Agents World.
TL;DR: This work establishes that if a goal can be realized by a configuration of Web-dwelling agents then a distinguished Manager Agent, with suitable Local Closed World knowledge of agents’ properties, may apply automata-based reasoning algorithms, selecting and configuring agents into a realizing device.
Book ChapterDOI
A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages
TL;DR: In this paper, the authors propose a new symbolic trace semantics for register automata (extended finite state machines) which records both the sequence of input symbols that occur during a run as well as the constraints on input parameters that are imposed by this run.
Journal ArticleDOI
Recognition of the factors of a finite language in a linear time text
TL;DR: In this paper, Blumer et al. introduce a transducteur (L) which reconnait tous les facteurs d'un langage fini L and place chacun d'eux comme facteur d'one of the mots of L. The construction of L is given in O(L √ lgmax) logarithm.
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.