Semirings, automata, languages
Semirings, automata, languages
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Two decidability problems for infinite words
Information Processing Letters
Introduction to algorithms
Economy of description for single-valued transducers
Information and Computation
Digital images and formal languages
Handbook of formal languages, vol. 3
Minimization algorithms for sequential transducers
Theoretical Computer Science
On the Determinization of Weighted Finite Automata
SIAM Journal on Computing
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Finite-state transducers in language and speech processing
Computational Linguistics
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
An optimal pre-determinization algorithm for weighted transducers
Theoretical Computer Science - Implementation and application of automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
General Algorithms for Testing the Ambiguity of Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Edit-distance of weighted automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Deciding the sequentiality of a finitely ambiguous max-plus automaton
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Residual languages and probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An efficient pre-determinization algorithm
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Homogeneity vs. adjacency: generalising some graph decomposition algorithms
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
Theoretical Computer Science
A disambiguation algorithm for finite automata and functional transducers
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Rigorous approximated determinization of weighted automata
Theoretical Computer Science
Evaluating test suite characteristics, cost, and effectiveness of FSM-based testing methods
Information and Software Technology
Hi-index | 0.00 |
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 automata [14]. However, not all finite-state transducers or weighted automata and transducers can be determinized using that algorithm, thus the question of the determinizability in that sense is essential. There exists a characterization of the determinizability of functional finite-state transducers and that of unambiguous weighted automata over the tropical semiring based on a general twins property. In the case of finite-state transducers, we give an efficient algorithm for testing functionality in time O(|Q|2 |Δ| +|E|2) where Q is the set of states, E the set of transitions, and Δ the output alphabet of the input transducer. We also present a new and computationally more efficient algorithm for testing the twins property whose complexity is O(|Q|2(|Q|2 + |E|2)). In the automata case, we present a new and substantially more efficient algorithm for testing the twins property for unambiguous and cycle-unambiguous weighted automata over commutative and cancellative semirings whose complexity is O(|Q|2 + |E|2), which we conjecture to be optimal. Our experiments show our algorithms for testing the twins property to be practical with large weighted automata and transducers of several million transitions found in speech recognition applications.