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: This paper study properties of mefa's and formulate a necessary and sufficient condition for regular sets to be mefa-recognizable and develop algorithms for testing for this condition and for constructing the recognizing mefa whenever this conditions is satisfied.
47 citations
17 Jun 2004
TL;DR: It is shown that for a reading window of size one and nonrecursive DTDs with one-unambiguous content there is an algorithm producing a deterministic automaton that validates documents with respect to that DTD, and conditions under which they can be validated against by using one-counter automata are considered.
Abstract: We study validation of streamed XML documents by means of finite state machines. Previous work has shown that validation is in principle possible by finite state automata, but the construction was prohibitively expensive, giving an exponential-size nondeterministic automaton. Instead, we want to find deterministic automata for validating streamed documents: for them, the complexity of validation is constant per tag. We show that for a reading window of size one and nonrecursive DTDs with one-unambiguous content (i.e. conforming to the current XML standard) there is an algorithm producing a deterministic automaton that validates documents with respect to that DTD. The size of the automaton is at most exponential and we give matching lower bounds. To capture the possible advantages offered by reading windows of size k, we introduce k-unambiguity as a generalization of one-unambiguity, and study the validation against DTDs with k-unambiguous content. We also consider recursive DTDs and give conditions under which they can be validated against by using one-counter automata.
47 citations
07 Dec 1988
TL;DR: The clock automaton is a special type of automaton used for decreasing the real-time behavior of processes, controllers, and real- time specifications.
Abstract: A discrete-event process is modeled as a controlled state machine, in the framework of D.J. Ramadge and W.M. Wohman (1986). Their approach is extended to model a class of real-time discrete-event processes by means of a special type of automaton, called a clock automaton. The clock automaton is used for decreasing the real-time behavior of processes, controllers, and real-time specifications. >
46 citations
TL;DR: A complete solution for binomial coefficients and Lucas′ numbers is given and some partial results for the general case are presented.
46 citations
TL;DR: In this article, a measure-once one-way general quantum finite automata (MO-1gQFA) was studied, where a measurement deciding to accept or reject is performed at the end of a computation and a similar measurement is performed after each trace-preserving quantum operation on reading each input symbol.
46 citations