Concept Of Automata Research Articles

New Ideas in Fuzzy Clustering and Fuzzy Automata

ABSTRACTIn this paper a close look is taken at the concepts of fuzzy clustering and fuzzy automata. In both instances fuzzy concepts are being applied to provide a medium level of intelligent behaviour in order to operate on and provide directives for low level control. The mean-tracking clustering algorithm which has been shown to be both computationally efficient and practically extremely useful, is explained and a fuzzy version of this is introduced. A direct link between fuzzy clustering and Radial Basis Function Neural Networks is then discussed and it is shown how, under certain circumstances, the two are in fact the same. Finally a new look is taken at fuzzy automata and their practical realisation.

Grey-tone skeletons of elongated objects using the concept of morphological automaton. Application to images of DNA molecules

An approximation of the skeleton of an elongated object is obtained using a modular morphological automaton (MMA), i.e. a self-adaptive operator composed of four modules. As an example, the skeleton of images of DNA molecules is built.

A self‐recovering communication buffer based on the concept of cellular automaton

AbstractThis paper presents a self‐recovering buffer memory for communication systems based on the concept of cellular automaton. The model proposed is a FIFO‐type (First‐in, First‐out‐type) memory which meets the conditions for a communication buffer and incorporates the principles of cellular automaton. By binding together a number of cells which can perform basic FIFO operations, it is found that each cell is capable of determining whether or not it is holding the first valid data in a queue based on information about its own status and it s neighboring cell.It also is observed that this model possesses a capacity for self recovery which always enables the buffer to return to a normal state in the event of an internal transient fault. Furthermore, by representing each cell with a sequential circuit, this buffer memory is prototyped with a gate array and its applicability is verified comparing it with existing FIFO design methods.

Integration of task planning and motion control in a multi-robot assembly workcell

Most of the existing multi-robot systems emphasize only one of two aspects, namely, plan generation and plan monitoring. There is a missing link between producing a multi-agent plan and its control during actual execution. The existence of this gap between planning and control precludes the possibility of automatically regenerating the execution plan to recover from unexpected error conditions and greatly limits the flexibility of the system. This paper describes a multi-robot task planning and execution system which successfully solves the integration problem by a two-phase five-layer structure. The concept of a finite-state automaton has been used as a tool to combine planning with simultaneous execution of parallel action. The developed system has been demonstrated for the assembly of a dishwasher power unit in a real experiment using a multi-robot assembly workcell consisting of an ADEPT I and a PUMA 560 robot placed close to each other so as to share a common workspace.

Reconfigurable control of power plants using learning automata

A deaerating feedwater heater, equipped with a water level controller and a pressure controller, is used to investigate the feasibility of a reconfigurable control scheme for power plants by incorporating the concept of learning automata. The approach uses stochastic automata to learn the current operating status of the plant by dynamically monitoring the system performance and then switching to the appropriate controller on the basis of the observed performance. Simulation results based on a model of the experimental breeder reactor (EBR-II) at the Argonne National Laboratory site in Idaho are presented to demonstrate the efficacy of the scheme. The results show that it is capable of providing a sufficient margin for the net positive suction head at the feedwater pumps under loss of steam flow into the deaerator. Under similar circumstances, the existing controller in the deaerator would be incapable of maintaining the pressure and its decay rate within the safe margins, and so would oblige the plant operator to take additional measures to protect the feedwater pumps. >

Formalization of the concept of multitape automaton

Formalization of the concept of multitape automaton

A topology for automata II

A topology on the state set of an automaton is considered and it is shown that under this topology, genetically closed subsets and primaries, in the sense of Bavel [1] turn out to be precisely the regular closed subsets and minimal regular closed subsets respectively. The concept of a compact automaton is introduced and it is indicated that it can be viewed as a generalization of a finite automaton. Included also is an observation showing that our topological considerations can help recover some of the results of Dörfler [2].

On branching and looping, part II

In Part I of this paper a theoretical framework has been developed for studying certain aspects of branching and looping in discrete processes. The present paper uses the formalism from Part I, based on the concept of finite branching automaton, to a detailed analysis of looping. In particular, two types of loops are distinguished in branching automata (the idle and the productive loops) and their occurrence is related to certain properties of families of languages associated with these automata.

On extension of stochastic k-automata

There are a great many research works concerning the well-known stochastic automata of Moore, Mealy, Rabin, Turing and others. Recently an automaton of Markov’s chain type has been introduced by Bartoszyński. This automaton is obtained by a generalization of Pawlak’s deterministic machine. The aim of this note is to give a concept of a stochastic automaton of Markov’s generalized chain type. The introduced automaton called a stochastic k-automaton (s.k-a.) is a common generalization of Bartoszyński’s automaton and Grodzki’s deterministic k-machine. By a stochastic k-automaton we mean an ordered triple M k = ⟨ U , a , π ⟩, k ⩾ 1, where U denotes a finite non-empty set, a is a function from Uk to [0, 1] with ∑ v ∈ U k a ( v ) = 1, and π is a function from Uk+1 to [0,1] with ∑ u ∈ U π ( v , u ) = 1 for every v ∈ U k . For all N ⩾ k we can define a probability measure PN on U N = U × U × … × U as follows: P N ( u 1 , u 2 , … , u N ) = a ( u 1 , u 2 , … , u k ) π ( u 1 , u 2 , … , u k + 1 ) π ( u 2 , u 3 , … , u k + 2 ) … π ( u N − k , u N − k + 1 , … , u N ). We deal with the problems of the shrinkage and the extension of a system of s.k-a.’s M k ( i ) = ⟨ U , a ( i ) , π ( i ) ⟩, i = 1 , 2 , … , m , m ⩾ 2. In this note there are given conditions under which an s.k-a. M k = ⟨ U , a , π ⟩ exists and the language of this automaton defined as L M = { ( u 1 , u 2 , u 3 , … ) : ∧ N ⩾ 1 P N ( u l , u 2 , … u N ) > 0 } either contains the languages of all the automata M k ( i ) , i = 1 , 2 , … , m, or this language equals the intersection of all those languages.

Categorical axiomatics of dynamic programming

In systems theory, we need some general framework to take into account various concepts from different fields (automata theory, dynamical systems, optimization theory, etc.). This work is a proposal for such a framework. A decision process model is given with the help of category theory. Sufficient conditions for the validity of the equation of optimality of Bellman are established in this model. This model also generalizes the concept of finite automaton. Thus we unify the concepts of automaton and decision system. Especially, we propose the new concept of “opt-automaton” (automaton which optimizes).

Probabilistic tree automata

It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try to get some quantitative measure of “efficiency” of translators and grammars for the language. The model obtained by doing this is called a probabilistic language. Probabilistic languages, along with related concepts of probabilistic grammars and probabilistic automata are defined, and a specific application of this theory is presented in the development of Probabilistic Tree Automata which characterize Probabilistic Context Free Languages.