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
Posted Content
TL;DR: A parallel disk-based algorithm is exhibited that uses a cluster of 29 commodity computers to produce an intermediate DFA with almost two billion states and then continues by producing the corresponding unique minimal D FA with less than 800,000 states.
Abstract: Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA), and then the production of the unique minimal DFA for the original NFA. We exhibit a parallel disk-based algorithm that uses a cluster of 29 commodity computers to produce an intermediate DFA with almost two billion states and then continues by producing the corresponding unique minimal DFA with less than 800,000 states. The largest previous such computation in the literature was carried out on a 512-processor CM-5 supercomputer in 1996. That computation produced an intermediate DFA with 525,000 states and an unreported number of states for the corresponding minimal DFA. The work is used to provide strong experimental evidence satisfying a conjecture on a series of token passing networks. The conjecture concerns stack sortable permutations for a finite stack and a 3-buffer. The origins of this problem lie in the work on restricted permutations begun by Knuth and Tarjan in the late 1960s. The parallel disk-based computation is also compared with both a single-threaded and multi-threaded RAM-based implementation using a 16-core 128 GB large shared memory computer.

8 citations

Proceedings ArticleDOI
09 Dec 2003
TL;DR: A synthesis methodology is obtained by extending to hybrid systems the stabilization techniques based on stable convex combinations, originally developed for switching systems, which is equivalent to a regular switching system on which classical stabilization techniques can be applied.
Abstract: The problem of stabilizing linear discrete-time hybrid automata is considered. A synthesis methodology is obtained by extending to hybrid systems the stabilization techniques based on stable convex combinations, originally developed for switching systems. The key idea is exploiting the underlying automaton structure by restricting the control actions to the ones corresponding to cycles in the automaton, which are identified using regular language tools. The so obtained system is equivalent to a regular switching system on which classical stabilization techniques can be applied. An algorithm to explore the candidate stabilizing controller actions is proposed and an application to an automotive engine control problem is described.

8 citations

Journal ArticleDOI
TL;DR: The properties of a discrete automaton with a finite memory can be determined by an experiment of a finite length, and methods for their optimal construction are presented.
Abstract: The characteristics of a discrete automaton with a finite memory can be determined by an experiment of a finite length. This paper discusses the properties of such experiments, and presents methods for their optimal construction. Specific results are given for binary-input automata with the memory ranges 0, 1, 2, 3 and 4.

7 citations

Journal Article
TL;DR: In this paper, a left-to-right algorithm for building an automaton that accepts all subsequences of a given set of strings is presented, and it is shown that the number of states of this automaton can be quadratic if built on at least two texts.
Abstract: We present a left-to-right algorithm building the automaton accepting all subsequences of a given set of strings. We prove that the number of states of this automaton can be quadratic if built on at least two texts.

7 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