scispace - formally typeset
Open AccessJournal ArticleDOI

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 satisfying

read more

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

AntPaP: Patrolling and Fair Partitioning of Graphs by A(ge)nts Leaving Pheromone Traces

TL;DR: A team of identical and oblivious ant-like agents - a(ge)nts - leaving pheromone traces, are programmed to jointly patrol an area modeled as a graph, and it is guaranteed that the system settles into a stable and balanced partition.
Book ChapterDOI

Certifying DFA Bounds for Recognition and Separation

TL;DR: In this paper, the authors propose to use determinacy of turn-based two-player games with regular winning conditions to generate certificates for the number of states that a deterministic finite automaton (DFA) needs in order to recognize a given language.

Andrew w. appel and guy j. jacobson

TL;DR: An efficient backtracking algorithm makes with a large dictionary and the heuristic of selecting possible a very fast program to play the SCRABBLE" Brand the move with the highest score at each turn makes a Crossword Game.
Book ChapterDOI

Graph Spectral Properties of Deterministic Finite Automata

TL;DR: It is proved that a minimal automaton has the minimal adjacency matrix rank and the minimalAdjacency matrix nullity among all equivalent deterministic automata.
References
More filters
Book ChapterDOI

Representation of Events in Nerve Nets and Finite Automata

S. C. Kleene
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.