Journal ArticleDOI
Characterizing Experiments for Finite-Memory Binary Automata
TLDR
The properties of a discrete automaton with a finite memory can be determined by an experiment of a finite length, and methods for their optimal construction are presented.Abstract:
The characteristics of a discrete automaton with a finite memory can be determined by an experiment of a finite length. This paper discusses the properties of such experiments, and presents methods for their optimal construction. Specific results are given for binary-input automata with the memory ranges 0, 1, 2, 3 and 4.read more
Citations
More filters
Book ChapterDOI
The Theory of Automata, a Survey
TL;DR: The chapter presents a survey, which focuses that part of automaton theory that lies outside of certain sub-theories—namely, switching theory, the theory of computability, artificial intelligence, and learning machines as well as several topics related to the statistical aspects of machines.
Journal ArticleDOI
Algorithmically unsolvable problems for a cell automaton.
TL;DR: It is impossible to prove that the simplified axiomatic cell model is an adequate representation of any real cell, but it allows the introduction of certain concepts of automata theory into molecular biology in a new and provocative manner.
References
More filters
Journal ArticleDOI
The Theory of Nets
TL;DR: This paper presents the general concept of a weighted directed graph which is called a net, and a non-arithmetic matrix calculus is developed to facilitate computations and formalize proofs.
Journal ArticleDOI
A Note on Memory Aspects of Sequence Transducers
TL;DR: In this paper, the authors define several classes of sequence transducers whose operations exhibit simple forms of memory, and some of the special properties and interrelationships for these classes of transducers are established.