On sparseness, ambiguity and other decision problems for acceptors and transducers
3rd annual symposium on theoretical aspects of computer science on STACS 86
Algorithms for determining relative star height and star height
Information and Computation
New results on the star problem in trace monoids
Information and Computation
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
Recognizable Sets with Multiplicities in the Tropical Semiring
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Efficient algorithms for testing the twins property
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Finite-state transducers in language and speech processing
Computational Linguistics
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
A better N-best list: practical determinization of weighted finite tree automata
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Deciding the twins property for weighted tree automata over extremal semifields
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
| Hi-index | 5.23 |
We solve a problem already investigated by Mohri in 1997: we show that the twins property for weighted finite automata over the tropical semiring is decidable and PSPACE-complete. We also point out that it is undecidable whether two given states are twins.