Topic
ω-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.
Papers published on a yearly basis
Papers
More filters
17 Sep 1998
TL;DR: The underlying ideas of a computer laboratory for symbolic manipulation of discrete random experiments andFinite automata, and associated formal series, are the basic theoretical tool for representing experiments, and for solving probability problems.
Abstract: In this paper, we discuss the underlying ideas of a computer laboratory for symbolic manipulation of discrete random experiments. Finite automata, and associated formal series, are the basic theoretical tool for representing experiments, and for solving probability problems. Starting from a description of a random experiment given as a special kind of regular expressions, the environment constructs automata from which it extracts generating series associated to the experiment.
TL;DR: The paper proposes and demonstrates usage of hyper complex symbols that realizes the objective of defining a generic mathematical model for the constrained automata targeted towards interoperability and possible integration amongst them.
Abstract: Finite State Automata have been extended in a number of ways with varied additional constraints with an objective of modeling varied real life problems. The current paper commonly refers to such extensions as constrained automata. It aims at defining a generic mathematical model for the constrained automata targeted towards interoperability and possible integration amongst them. The paper proposes and demonstrates usage of hyper complex symbols that realizes the objective.
17 Oct 2005
TL;DR: It is proved that the inference of a class of timed automata (event recording automata) to be harder than the inferred inference of finite automata.
Abstract: We argue that timed models are a suitable framework for the detection of behavior in real-world event systems A timed model which detects behavior is constructible by a domain expert The inference of these timed models from data is a hard problem We prove the inference of a class of timed automata (event recording automata) to be harder than the inference of finite automata
TL;DR: One of the challenges is to test the equivalence of Transducers, and the results will be shown in this paper will show that Transducers and Finite Automata are equivalent.
Abstract: Today Finite Automata are used in several areas of economy and research, for example in language and text processing or E-Commerce. There are often automata with more than hundred thousand states. Minimization of such automata can only be done by classical minimization methods. But this doesnt produce Minimal Finite Automata with output. A Transducer is a special Finite Automata that produces an output. One of the challenges is to test the equivalence of Transducers, this will be shown in this paper.
01 Jan 2011
TL;DR: In this paper strongγ- synchronized automata is introduced and algorithm is given to find the strong γ- synchronized word for a fuzzy automata.
Abstract: In this paper strongγ- synchronized automata is introduced and algorithm is given to find the strong γ- synchronized word for a fuzzy automata.