Journal ArticleDOI
The Theory of Definite Automata
M. Perles,M. O. Rabin,E. Shamir +2 more
Reads0
Chats0
TLDR
A notion of equivalence of definite events is introduced and the uniqueness of the minimal automaton defining an event in an equivalence class is proved.Abstract:
A definite automaton is, roughly speaking, an automaton (sequential circuit) with the property that for some fixed integer k its action depends only on the last k inputs. The notion of a definite event introduced by Kleene, as well as the related concepts of definite automata and tables, are studied here in detail. Basic results relating to the minimum number of states required for synthesizing an automaton of a given degree of definiteness are proved. We give a characterization of all k-definite events definable by k+1 state automata. Various decision problems pertaining to definite automata are effectively solved. We also solve effectively the problem of synthesizing a minimal automaton defining a given definite event. The solutions of decision and synthesis problems given here are practical in the sense that if the problem is presented by n units of information, then the algorithm in question requires about n3 steps of a very elementary nature (rather than requiring about 2n steps as some algorithms for automata do, which puts them beyond the capacity of the largest computers even for relatively small values of n). A notion of equivalence of definite events is introduced and the uniqueness of the minimal automaton defining an event in an equivalence class is proved.read more
Citations
More filters
Book
An Introduction to Symbolic Dynamics and Coding
Douglas Lind,Brian Marcus +1 more
TL;DR: Requiring only a undergraduate knowledge of linear algebra, this first general textbook includes over 500 exercises that explore symbolic dynamics as a method to study general dynamical systems.
Book ChapterDOI
The Algebraic Theory of Context-Free Languages*
TL;DR: This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial languages of various kinds.
Book ChapterDOI
CHAPTER 1 – Finite Automata
TL;DR: The field of finite automata is a branch of mathematics connected with the algebraic theory of semigroups and associative algebras as discussed by the authors, which is one of the most important areas of automata research.
Journal ArticleDOI
Inference of Reversible Languages
TL;DR: An efficient algonthrn is presented for mfernng reversible languages from posmve and negative examples, and it is shown that it leads to correct identification m the hmlt of the class of reversible languages.
Probabilistic automata
TL;DR: A probabilistic or stochastic automaton is a device with a finite number of internal states that scans input words over a finite alphabet and responds by successively changing its state in a Probabilistic way.
References
More filters
Journal ArticleDOI
Finite automata and their decision problems
Michael O. Rabin,Dana Scott +1 more
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
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.