Open AccessProceedings Article
On the degree of ambuguity of finite automata
About:
This article is published in Mathematical Foundations of Computer Science.The article was published on 1986-06-01 and is currently open access. It has received 7 citations till now. The article focuses on the topics: Timed automaton & Nondeterministic finite automaton.read more
Citations
More filters
Journal ArticleDOI
On the valuedness of finite transducers
TL;DR: The valuedness of a finite-valued nondeterministic generalized sequential machine (NGSM) M with n states and output alphabet Δ is at most the maximum of (1-⌊1/#Δ⌋) and the above upper bound for the valuedness is almost optimal.
Journal ArticleDOI
Queries on Xml streams with bounded delay and concurrency
TL;DR: This work studies queries defined by deterministic nested word automata, which subsume large streamable fragments of XPath subject to schema restrictions by DTDs modulo P-time translations, and shows that bounded and k-bounded delay and concurrency of such automata-defined queries are all decidable in polynomial time in the size of the automaton.
Book ChapterDOI
General Algorithms for Testing the Ambiguity of Finite Automata
TL;DR: In this article, the complexity of testing finite, polynomial, and exponential ambiguity of finite automata with i¾?-transitions was improved to O(|A|_E^2), where |A| E denotes the number of transitions of an automaton.
Book ChapterDOI
Bounded Delay and Concurrency for Earliest Query Answering
TL;DR: This work studies the feasibility of earliest query answering for node selection queries and shows that both properties are decidable in polynomial time for queries defined by deterministic automata for unranked trees.
Journal Article
Quality-aware service delegation in automated web service composition: an automata-theoretic approach
TL;DR: This work follows the "Roman" service composition framework and extend it with a QoS model and uses the Presburger arithmetic to specify constraints, and proves that the constrained service delegation problem can be solved in polynomial time in the number of service requests and delegation constraints.