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… (More)
DOI: 10.1007/978-3-540-85780-8_8


4 Figures and Tables

Slides referencing similar topics