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
Journal Article•
TL;DR: Two classes of finite automata are defined and the complexity of their determinization are shown, called generalized homogenous finite Automata and semihomogenous finite automaton.
Abstract: The number of states of a deterministic finite automaton, which is equivalent to a nondeterministic finite automaton is bounded by 2, where n is the number of states of the nondeterministic finite automaton. This bound is very pesimistic. Some subclasses of finite automata are shown, for which the complexity of determinization is far lower. On the base of pioneering idea of homogenous finite automata, two classes of finite automata are defined and the complexity of their determinization are shown. These classes are called generalized homogenous finite automata and semihomogenous finite automata.
2 citations
07 Aug 2017
TL;DR: It was shown that DSA-languages look similar to DCFL due to their closure properties and NSA-l languages lookSimilar to CFLdue to their undecidability properties.
Abstract: We consider a computational model which is known as set automata. The set automata are one-way finite automata with an additional storage—the set. There are two kinds of set automata—the deterministic and the nondeterministic ones. We denote them as DSA and NSA respectively. The model was introduced by M. Kutrib, A. Malcher, M. Wendlandt in 2014 in [3, 4]. It was shown that DSA-languages look similar to DCFL due to their closure properties and NSA-languages look similar to CFL due to their undecidability properties.
2 citations
Posted Content•
TL;DR: This work studies the notion of u-universality, which asserts that the automaton accepts every input starting with u, and proposes efficient antichain-based techniques to address these problems for visibly pushdown automata operating on trees.
Abstract: An automaton is universal if it accepts every possible input. We study the notion of u-universality, which asserts that the automaton accepts every input starting with u. Universality and u-universality are both EXPTIME-hard for non-deterministic tree automata. We propose efficient antichain-based techniques to address these problems for visibly pushdown automata operating on trees. One of our approaches yields algorithms for the universality and u-universality of hedge automata.
2 citations
25 Aug 2008
TL;DR: It turns out that single-process service automata are equivalent to vector addition systems and hence can define nonregular processes, and multiprocess service Automata are strictly more powerful than single- processes.
Abstract: Inspired by P systems initiated by Gheorghe Paun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two objects. Our model, called service automata, is intended to specify, at a high level, a service provided on top of network devices abstracted as communicating objects. We formalize the concept of processes, running over a multiset of objects, of a service automaton and study the computing power of both single-process and multiprocess service automata. In particular, in the multiprocess case, regular maximal parallelism is defined for inter-process synchronization. It turns out that single-process service automata are equivalent to vector addition systems and hence can define nonregular processes. Among other results, we also show that Presburger reachability problem for single-process service automata is decidable, while it becomes undecidable in the multiprocess case. Hence, multiprocess service automata are strictly more powerful than single-process service automata.
2 citations
TL;DR: The experience showed that the convolutions of Moore and Mealy automata are suited for the description of various telecommunication systems, and a description of queuing telecommunication system using the convolution of these automata is presented.
Abstract: At present imitation models, describing various telecommunication systems and realized by computers, are particularly topical. Problems how to describe the telecommunication systems using such mathematical – informational concepts that would enable to create corresponding simulation models which are used for calculating the various telecommunication systems characteristics. The experience showed that the convolutions of Moore and Mealy automata are suited for the description of such systems. Classical Moore and Mealy automata have only the finite number of states and signals, but when they are used for the description of the telecommunication systems, it is expedient to augment the number of their states and signals until the infinite number. The time is included into automata, too. Moreover, the convolution of the automata means that the output signals of one automaton coincide with the input signals of another automaton. Then it is sufficient to create corresponding surjections, according to which the simulation model can be created. A description of queuing telecommunication system using the convolution of Moore and Mealy automata is presented. Ill. 6, bibl. 7 (in English; summaries in Lithuanian, English and Russian).
2 citations