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
Journal ArticleDOI
Most Complex Regular Ideal Languages
TL;DR: In this article, it was shown that for right, left, and two-sided regular ideals, there exist sequences of regular ideals with quotient complexity (state complexity) (i.e., the size of the syntactic semigroup, the quotient complexities of the left quotients of a language, the number of atoms (intersections of complemented and uncomplemented left quotient), and the quotieness of the atoms), such that the language is most complex in its class under the following measures of complexity.
Journal ArticleDOI
Minimization and Canonization of GFG Transition-Based Automata
TL;DR: In this paper , a polynomial minimization algorithm for GFG co-Buchi word automata with transition-based acceptance is presented, where a run is accepted if it traverses a set of designated transitions only finitely often.
Dissertation
Representation of regular formal languages.
TL;DR: This dissertation presents three different approaches to representing Regular Formal languages, i.e., regular expressions, finite acceptors and regular grammars, and defines how each method is used to represent the language.
NFA reduction via hypergraph vertex cover approximation
TL;DR: An algorithm for approximating vertex cover on k-partite k-uniform hypergraphs based on a theorem by Lovász is introduced and the use of fractional cover algorithms to improve the running time at the expense of a small increase in the approximation ratio is explored.
Journal ArticleDOI
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.
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.