Showing papers on "ω-automaton published in 1984"
TL;DR: Emergent, highly ordered dynamical behavior in random automata rich in a specific class of “canalizing” Boolean functions due to the crystallization of powerful subautomata called forcing structures is discussed.
243 citations
TL;DR: It is shown that for one type of acceptance condition alternation increases the power in comparison with nondeterminism and for other three acceptance conditions nondeterministic finite automata on ω-words have the same power as alternating ones.
229 citations
03 Dec 1984
TL;DR: For Rabin pair automata [R1] a standard form is defined /def.
Abstract: For Rabin pair automata [R1] a standard form is defined /def. 2/ i.e. such that an ordered subset {s1,...,s2I-1} of states is distinguished in such a way that a path of a run is accepting /rejecting if for some i even/ odd, 1≤i≤2I-1, the si appears infinitely often, and all sj, j
152 citations
01 May 1984
TL;DR: The automata considered have a variable structure and hence are completely described by action probability updating functions and are called discretized linear reward-inaction automata, which are proved for all environments.
Abstract: The automata considered have a variable structure and hence are completely described by action probability updating functions. The action probabilities can take only a finite number of prespecified values. These values linearly increase and the interval [0, 1] is divided into a number of equal length subintervals. The probability is updated by the automata only if the environment responds with a reward and hence they are called discretized linear reward-inaction automata. The asymptotic optimality of this family of automata is proved for all environments.
57 citations
TL;DR: In this article, a theory of infinitary rational relations, which is an extension of the theory of finitary rational relation, is presented, where the condition of recognizability of an infinite word is that its reading by the automaton must go through a state, wich belongs to a designated subset, infinitly time.
Abstract: In this paper, we build a theory of infinitary rational relations, which is an extension of the theory of finitary rational relations, i. e. sets ofK-vectors of finite words which are recognized by finite automata withK tapes, and at the same time an extension of the theory of infinitary rational languages, i.e., sets of finite and infinite words which are recognized by finite automata (the condition of recognizability of an infinite word is that its reading by the automaton must go through a state, wich belongs to a designated subset, infinitly time).
44 citations
14 May 1984
21 citations
TL;DR: This work defines a class ofn-ary relations on strings called the regular prefix relations, and gives four alternative characterizations of this class, the smallest class containing the regular sets and the prefix relation, and closed under the Boolean operations, Cartesian product, projection, explicit transformation, and concatenation with Cartesian products of regular sets.
Abstract: We define a class ofn-ary relations on strings called the regular prefix relations, and give four alternative characterizations of this class:
We give concrete examples of regular prefix relations, and a pumping argument for prefix automata An application of these results to the study of inductive inference of regular sets is described
19 citations
TL;DR: Application of existing concepts and techniques of information theory to general deterministic one-dimensional cellular automata with mappings of the unit interval into itself allows the machinery of dynamical systems analysis to be employed.
11 citations
Proceedings Article•
05 Sep 1984
10 citations
7 citations
03 Sep 1984
TL;DR: The authors shall deal with the power of alternation in finite automata theory by identifying the simplest devices according to the language family accepted by them such that the alternating version of these devices is as powerful as Turing machines.
Abstract: We shall deal with the following three questions concerning the power of alternation in finite automata theory:
1.
What is the simplest kind of device for which alternation adds computational power ?
2.
What are the simplest devices (according to the language family accepted by them) such that the alternating version of these devices is as powerful as Turing machines ?
3.
Can the number of alternations in the computations of alternating devices be bounded by a function of input word length without the loss of the computational power ?
TL;DR: A necessary and sufficient condition of equivalence is given, which uses considerations over finite behaviors only, and an algorithm for the general case is given; its time and space complexity is better than any other existent method.
01 May 1984
TL;DR: It is shown that the MGAE scheme is ϵ-optimal in the nonstationary multiteacher environment.
Abstract: Learning behaviours of variable-structure stochastic automata operating in a nonstationary multiteacher environment are considered. As an extended form of the GAE reinforcement scheme, the MGAE scheme is proposed as a reinforcement scheme for a multiteacher environment from which stochastic automata receive responses having arbitrary numbers between 0 and 1. It is shown that the MGAE scheme is ϵ-optimal in the nonstationary multiteacher environment.