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
TL;DR: To pelucide the whole structure of the classes and precise relations between them it is proved that the complexity hierarchy is proved.
37 citations
Posted Content•
TL;DR: This chapter describes the minimization algorithm by fusion for so-called local automata, and considers the case of updating a minimal automaton when a word is added or removed from the set it recognizes.
Abstract: This chapter is concerned with the design and analysis of algorithms for minimizing finite automata. Getting a minimal automaton is a fundamental issue in the use and implementation of finite automata tools in frameworks like text processing, image analysis, linguistic computer science, and many other applications. There are two main families of minimization algorithms. The first by a sequence of refinements of a partition of the set of states, the second by a sequence of fusions or merges of states. Hopcroft's and Moore's algorithms belong to the first family, the linear-time minimization of acyclic automata of Revuz belongs to the second family.
One of our studies is upon the comparison of the nature of Moore's and Hopcroft's algorithms. This gives some new insight in both algorithms. As we shall see, these algorithms are quite different both in behavior and in complexity. In particular, we show that it is not possible to simulate the computations of one of the algorithm by the other. We describe the minimization algorithm by fusion for so-called local automata. A special case of minimization is the construction o minimal automata for finite sets. We consider briefly this case, and in particular describe incremental algorithms. Finally, we consider the case of updating a minimal automaton when a word is added or removed from the set it recognizes.
37 citations
11 Sep 2000
TL;DR: It is shown that DeLeTe can produce the canonical RFSA of a regular language L from any sample S which contains S L and a learning algorithm (DeLeTe) is defined.
Abstract: We define here the Residual Finite State Automata class (RFSA). This class, included in the Non deterministic Finite Automata class, strictly contains the Deterministic Finite Automata class and shares with it a fundamental property : the existence of a canonical minimal form for any regular language. We also define a notion of characteristic sample S L for a given regular language L and a learning algorithm (DeLeTe). We show that DeLeTe can produce the canonical RFSA of a regular language L from any sample S which contains S L . We think that working on non deterministic automata will allow, in a great amount of cases, to reduce the size of the characteristic sample. This is already true for some languages for which the sample needed by DeLete is far smaller than the one needed by classical algorithms.
37 citations
Book•
01 Jan 1981
TL;DR: When you read more every page of this automata theory machines and languages, what you will obtain is something great.
Abstract: Read more and get great! That's what the book enPDFd automata theory machines and languages will give for every reader to read this book. This is an on-line book provided in this website. Even this book becomes a choice of someone to read, many in the world also loves it so much. As what we talk, when you read more every page of this automata theory machines and languages, what you will obtain is something great.
36 citations
TL;DR: Two sequential learning models, A and B, having deterministic and stochastic transition rules, respectively, are formulated based on the strategies of ''many-armed bandit problems,'' and automata using these strategies have shown the desired learning behavior, which is similar to the performance of linear-strategy automata and certain type of Stochastic automata.
36 citations