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
Journal ArticleDOI

Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages

TL;DR: It is proved that n^n^-^2 is a tight upper bound for prefix-free regular languages.
Journal ArticleDOI

Learning Regular Languages over Large Ordered Alphabets

TL;DR: A generic model where transitions are labeled by elements of a finite partition of the alphabet is defined and Angluin's L* algorithm is extended for learning regular languages from examples for such automata.
Journal Article

Les débuts de la théorie des automates

TL;DR: In this paper, a caractere historique faite au seminaire Philosophie et Mathematiques (Pierre Cartier, Maurice Caveing, Maurice Loi, Rene Thom) a l'Ecole normale superieure le 25 janvier 1993.
Dissertation

Monitoring and Supervisory Control for Opacity Properties

TL;DR: This thesis investigates the problems of verifying and enforcing confidentiality on critical systems and develops new algorithms to compute a most permissive controller enforcing the opacity property on a given system.

Animal Pattern-Learning Experiments: Some Mathematical Background∗

TL;DR: A number of recent studies on the learning of invented patterns in symbol sequences by animals, songbirds, and undergraduates have shown interest in the contrast between two classes of sets of strings: the finite-state and the context-free.
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.