ω-automaton

About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.

Hybrid automata models in continuous-linear hybrid systems analysis

Abstract: We introduce some analysis tools for a class of continuous-linear hybrid systems. The continuous-linear term is used in the sense of system theory and it is in this sense that continuous-linear hybrid automata are defined. Using the defined automaton representation, we provide an analytical formulation of the system dynamic behavior. With the analysis results, dynamic properties for reachability and limit cycle analysis purposes are established. Finally, a coupled hybrid case is conducted.

Learning Finite Automata Using Local Distinguishing Experiments.

Abstract: One of the open problems listed in Rivest and Schapire is whether and how that the copies of L in their algorithm can be com bined into one for better performance This paper describes an algorithm called D that does that combination The idea is to represent the states of the learned model using observable symbols as well as hidden symbols that are con structed during learning These hidden sym bols are created to re ect the distinct behaviors of the model states The distinct behaviors are represented as local distinguishing experiments LDEs not to be confused with global distin guishing sequences and these LDEs are cre ated when the learner s prediction mismatches the actual observation from the unknown ma chine To synchronize the model with the en vironment these LDEs can also be concate nated to form a homing sequence It can be shown that D can learn with probability a model that is an approximation of the unknown machine in a number of actions polynomial in the size of the environment and log

On beta-skeleton automata with memory

Abstract: A \beta-skeleton is a proximity undirected graph whose connectivity is determined by the parameter \beta. We study \beta-skeleton automata where every node is a finite state machine taking two states, and updating its states depending on the states of adjacent automata-nodes. We allow automata-nodes to remember their previous states. In computational experiments we study how memory affects the global space-time dynamics on \beta-skeleton automata.

On directable nondeterministic trapped automata

Abstract: A finite automaton is said to be directable if it has an input word, a directing word, which takes it from every state into the same state. For nondeterministic (n.d.) automata, directability can be generalized in several ways. In [8], three such notions, D1-, D2-, and D3-directability, are introduced. In this paper, we introduce the trapped n.d. automata, and for each i = 1, 2, 3, present lower and upper bounds for the lengths of the shortest Di-directing words of n-state Di-directable trapped n.d. automata. It turns out that for this special class of n.d. automata, better bounds can be found than for the general case, and some of the obtained bounds are sharp.

Completeness conditions for finite automata

Abstract: This paper contains results obtained by the author during work in the seminar on the theory of finite automata held at the Computer Centre of the Ukrainian Academy of Sciences under V.M. Glushkov. The problem of completeness for finite automata was formulated by Glushkov in his lectures on the theory of finite automata at Kiev University. Some sufficient conditions of completeness were given there. In the present paper the problem of completeness is solved for a certain kind of composition and some methods of realization of automata.