General Algorithms for Testing the Ambiguity of Finite Automata
نویسندگان
چکیده
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ǫtransitions. It gives an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|2E), and finite or polynomial ambiguity in time O(|A|3E), where |A|E denotes the number of transitions of A. These complexities significantly improve over the previous best complexities given for the same problem. Furthermore, the algorithms presented are simple and based on a general algorithm for the composition or intersection of automata. We also give an algorithm to determine in time O(|A|3E) the degree of polynomial ambiguity of a polynomially ambiguous automaton A. Finally, we present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton.
منابع مشابه
General Algorithms for Testing the Ambiguity of Finite Automata and the Double-Tape Ambiguity of Finite-State Transducers
We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ǫ-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time O(|A| E ), and finite or polynomial ambiguity in time O(|A| E ), where |A|E denotes the number of transitions of A. These complexities significantly improve over the previous best...
متن کاملReduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملEfficient Algorithms for Testing the Twins Property
Weighted automata and transducers are powerful devices used in many large-scale applications. The efficiency of these applications is substantially increased when the automata or transducers used are deterministic. There exists a general determinization algorithm for weighted automata and transducers that is an extension of the classical subset construction used in the case of unweighted finite...
متن کاملProbabilistic Automata of Bounded Ambiguity
Probabilistic automata are a computational model introduced by Michael Rabin, extending nondeterministic finite automata with probabilistic transitions. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are undecidable. In this work we focus on the emptiness problem, which asks whether a given probabilistic automaton accepts some word with pr...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کامل