Showing papers on "ω-automaton published in 1977"
24 citations
TL;DR: This paper introduces a new product called the cartesian composition and discusses how various properties of the product automaton depend on the corresponding properties ofThe factors.
Abstract: There are several known ways to define a product automaton on the cartesian product of the state sets of two given automata. This paper introduces a new product called the cartesian composition and discusses how various properties of the product automaton depend on the corresponding properties of the factors. A main result is that any finite connected automaton has a unique representation as a cartesian composition of prime automata.
22 citations
01 Aug 1977
TL;DR: The consequences of adding a new teacher to an existing n-teacher set as it affects the choice of a switching strategy for a specific automaton structure are concentrated on.
Abstract: The concept of an automaton operating in a multi-teacher environment is introduced, and several interesting questions that arise in this context are examined. In particular, we concentrate on the consequences of adding a new teacher to an existing n-teacher set as it affects the choice of a switching strategy. The effect of this choice on expediency and speed of convergence is presented for a specific automaton structure.
17 citations
15 citations
TL;DR: The class of degree-languages over push-down automata (linear bounded automata) contains the intersection-closure and the complements of the context-free (context-sensitive) languages and it is contained in the Boolean closure of the contexts-free and context-sensitive languages.
9 citations
TL;DR: A direct product decomposability of automata is demonstrated, and the hierarchy of Automata which is characterized by the characteristic semigroups is discussed.
8 citations
TL;DR: A finite state probabilistic automaton existed that would accept a context sensitive language that is not context free and this automaton is constructed.
Abstract: It is known that nonregular languages can be accepted by finite state probabilistic automata. For many years it was not known whether a finite state probabilistic automaton existed that would accept a context sensitive language that is not context free. Such a finite state probabilistic automaton is constructed.
2 citations
1 citations
Journal Article•
01 Mar 1977-International Journal of Human-computer Studies \/ International Journal of Man-machine Studies
TL;DR: Computer simulation results show that automata structures discussed in this paper compare well with two-armed bandit models and provide a measure of the learning capacity of the automaton.
Abstract: Stochastic automata models capable of exhibiting unconditional learning behaviour are proposed and their behaviour analysed when operating in a stationary random environment about which they have no a priori knowledge. The automaton expected expected penalty is used as a performance index to assess its capability to acquire information pertaining to the unknown features of the environment. The optimization of the performance index provides a measure of the learning capacity of the automaton. The interaction between an automaton and a random media is also considered in the context of the two-armed bandit problem. Computer simulation results show that automata structures discussed in this paper compare well with two-armed bandit models.