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
Book ChapterDOI
Lectures on Controllability and Observability
TL;DR: The theory of controllability and observability has been developed, one might almost say reluctantly, in response to problems generated by technological science, especially in areas related to control, communication, and computers.
Book ChapterDOI
Combining Model Learning and Model Checking to Analyze TCP Implementations
TL;DR: This work uses model learning to infer models of different software components and then applies model checking to fully explore what may happen when these components interact.
Journal ArticleDOI
From regular expressions to DFA's using compressed NFA's
Chia-Hsiang Chang,Robert Paige +1 more
TL;DR: This thesis exploits a method of program improvement in which costly repeated calculations can be avoided by establishing and maintaining program invariants by exploiting the method of symbolic finite differencing.
Proceedings ArticleDOI
Inferring Finite-State Models with Temporal Constraints
Neil Walkinshaw,Kirill Bogdanov +1 more
TL;DR: This paper describes an extension of an existing state machine inference technique that accounts for temporal logic formulae, and encourages the addition of new formULae as the inference process converges on a solution.
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.