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: Every strongly connected automaton in this new class of automata is synchronizing and has a synchronizing word of length @?n(n+1)6@?
60 citations
TL;DR: This study considers a concept of complete L-fuzzy matrix, defines complete lattice-valued finite automata (CLFAs) and study their properties, and gives two algorithms aimed at the minimization of states of a CLFA.
60 citations
15 Feb 2001
TL;DR: In this article, the authors examined necessary and sufficient conditions for a regular language to be recognized by a quantum finite automata and proved that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Abstract: It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient.
Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
59 citations
21 Sep 2010
TL;DR: The natural reachability and termination problems for recursive timed automata are shown to be decidable for automata with as few as three clocks and similar results are established for two-player game extension of the model against reachability/termination objective.
Abstract: We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive) invocations of other timed automata from their collection. During an invocation of a timed automaton, our model permits passing the values of clocks using both pass-byvalue and pass-by-reference mechanisms. We study the natural reachability and termination (reachability with empty invocation stack) problems for recursive timed automata. We show that these problems are decidable (in many cases with the same complexity as the reachability problem on timed automata) for recursive timed automata satisfying the following condition: during each invocation either all clocks are passed by reference or none is passed by reference. Furthermore, we show that for recursive timed automata that violate this condition reachability/termination problems are undecidable for automata with as few as three clocks. We also establish similar results for two-player game extension of our model against reachability/termination objective.
59 citations
TL;DR: An enhanced version of automata are presented, called history dependent automata, that are adequate to represent the operational semantics of ?
59 citations