scispace - formally typeset
Search or ask a question
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
More filters
Book ChapterDOI
16 Jul 2003
TL;DR: This paper compares automaton sizes constructed from 10 different regular expressions, both before and after the rewriting transformation, and finds that smaller/faster automata are more likely to be built.
Abstract: Traditionally, regular expressions are transformed into (deterministic) finite automata, which are then used in, for example, searching and parsing. For an introduction to automata and regular expressions, refer to [1]. For every automaton, there is an infinite number of other automata that recognizes exactly the same language, although memory usage and performance can differ. This has lead to the wide-spread use of automata minmization techniques. In the same way, for every regular expression, there exists an infinite number of equivalent regular expressions, some of which lead to smaller/faster automata. This paper compares automaton sizes constructed from 10 different regular expressions, both before and after the rewriting transformation. Rewriting is done based on a rule set directly derived from the regular expression language (i.e. Kleene Algebra) axioms; these are listed in Table 1. The first three automata tested are the Thompson NFA [2], the Position NFA [3], and the Follow e-NFA [4]. The remaining three automata are the determinized counterparts of each NFA. For these DFA, the size of the minimized DFA is provided for comparison. For a list of the regular

6 citations

Book ChapterDOI
12 Jul 1998
TL;DR: This work trains an Elman recurrent neural network with a set of sentences in a language and extracts a finite automaton by clustering the states of the trained network, and observes that the generalizations beyond the training set are due to the training regime.
Abstract: We consider the problem of learning a finite automaton with recurrent neural networks from positive evidence. We train an Elman recurrent neural network with a set of sentences in a language and extract a finite automaton by clustering the states of the trained network. We observe that the generalizations beyond the training set, in the language recognized by the extracted automaton, are due to the training regime: the network performs a “loose” minimization of the prefix DFA of the training set, the automaton that has a state for each prefix of the sentences in the set.

6 citations

01 Jan 2008
TL;DR: It is shown that any flnite language as well as any unary regular language can be recognized by a Watson-Crick automaton with only two and respectively three states, and formally deflne the notion of determinism for these systems.
Abstract: Watson-Crick automata are flnite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of de- scriptional complexity of Watson-Crick automata initiated in (9). In particular, we show that any flnite language as well as any unary regular language can be recognized by a Watson-Crick automaton with only two and respectively three states. Also, we formally deflne the notion of determinism for these systems. Contrary to the case of non-deterministic Watson-Crick automata, we show that for deterministic ones, the complementarity relation plays a major role in the acceptance power of these systems.

6 citations

Proceedings ArticleDOI
05 Jul 2016
TL;DR: In this paper, it was shown that for a wide class of quantitative functions, automata with monitor counters and nested weighted automata are equivalent, and that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics.
Abstract: Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions, we establish that automata with monitor counters and nested weighted automata are equivalent. We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics. We present a complete picture of decidability for such automata, and even an almost-complete picture of computational complexity, for the probabilistic questions we consider.

6 citations

Journal ArticleDOI
TL;DR: After introducing complement sets for events in a plant automaton, the results of this paper are used to identify a polynomial time hierarchy for certain intractable subclasses of SUPMM identified in this paper.
Abstract: An instance of a modular supervisory control problem involves a plant automaton, described either as a monolithic, finite-state automaton (SUP1M), or as the synchronous product of several finite-state automata (SUPMM), along with a set of finite state, specification automata on a common alphabet. The marked language of the synchronous product of these automata represents the desired specification. A supervisory policy that solves the instance selectively disables certain events, based on the past history of event-occurrences, such that the marked behavior of the supervised system is a non-empty subset of the desired specification. Testing the existence of a supervisory policy for a variety of in stances of modular supervisory control is PSPACE-complete [1]. This problem remains intractable even when the plant is a monolithic finite state automaton and the specification automata are restricted to have only two states with a specific structure [2]. We refer to this intractable class as SU P1Ω in this paper. After introducing complement sets for events in a plant automaton, we identify a subclass of SUP1Ω that can be solved in polynomial time. Using this class as the base, inspired by a family of subclasses of SAT (cf. section 4.2, [3]) that can be solved in polynomial time [4], we develop a family of subclasses of SUP1Ω that can be solved in polynomial time. The results of this paper are also used to identify a polynomial time hierarchy for certain intractable subclasses of SUPMM identified in this paper.

6 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Data structure
28.1K papers, 608.6K citations
83% related
Model checking
16.9K papers, 451.6K citations
83% related
Approximation algorithm
23.9K papers, 654.3K citations
82% related
Petri net
25K papers, 406.9K citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202219
20201
20191
20185
201748