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
Proceedings ArticleDOI
01 Oct 2016
TL;DR: This paper considers two properties of timed automata, which help to reduce their complexity, the first concerns redundant time variables and the second - timed automaton composition.
Abstract: In this paper we consider two properties of timed automata, which help to reduce their complexity. We understand complexity as the number of time variables associated with a given timed automaton. The first property concerns redundant time variables and the second — timed automata composition.
Journal ArticleDOI
TL;DR: The state reachability problem in monomial form is proved to be undecidable for two-dimensional affine automata and an analogue of Moore's theorem and theorems on homogenous and diagnostic words are proved.
Abstract: Linear and affine automata are considered in their general form. The concept of dimensions of a finite automaton is introduced and finite automata of maximal dimensions are shown to be possible. The state reachability problem in monomial form is proved to be undecidable for two-dimensional affine automata. An analogue of Moore's theorem and theorems on homogenous and diagnostic words are also proved. An application of linear automata to mathematical economics is considered.
Proceedings ArticleDOI
15 Oct 2001
TL;DR: An order relationship over the set of states allows a) to define another order relation between the states of a composed automaton, b) to simplify the model of the composed Automaton, and c) derive some interesting properties for supervisory control.
Abstract: Hybrid systems combine both continuous dynamics and discrete-event behavior that interact with each other. The continuous part of the system is abstracted by discrete variables. The behavior is modeled by a finite state automaton. An order relationship over the set of states allows a) to define another order relation between the states of a composed automaton, b) to simplify the model of the composed automaton, and c) derive some interesting properties for supervisory control.
Posted Content
TL;DR: In this paper, it was shown that any Mealy automata with no cycles with exit can be shown to generate a semi-group, regardless of the choice of the production function.
Abstract: Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of the production functions. Antonenko has proved that this constitutes a characterization in the non-invertible case and asked for the invertible case, which is proved in this paper.
Book ChapterDOI
01 Jan 2008
TL;DR: Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton.
Abstract: Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.

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