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
A succinct canonical register automaton model
TL;DR: A novel canonical automaton model, based on register automata, that can easily be used to specify protocol or program behavior, and is easier to comprehend than previous proposals, but it can also be exponentially more succinct than these.
Active learning of interface programs
TL;DR: This thesis addresses the problem of inferring interface programs of systems at runtime using active automata learning techniques and proposes an efficient active learning algorithm for DFAs and Mealy machines that combines the ideas of several known active learning algorithms in a non-trivial way.
Book ChapterDOI
From Regular Expressions to DFA's Using Compressed NFA's
Chia-Hsiang Chang,Robert Paige +1 more
TL;DR: The representation can be used to compute the set U of states one transition away from the states in V in optimal time O(¦V¦+¦U¦).
Posted Content
Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages
TL;DR: In this article, the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages is studied and tight upper bounds on their size are given. But they do not consider prefix-free languages.
Journal ArticleDOI
Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
TL;DR: The purpose of the present work is to construct a minimal deterministic fuzzy automaton and to provide a minimal monoid representation for a given fuzzy language in a categorical framework.
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.