THE COMPLEXITY OF OPTIMIZING FINITE-STATE TRANSDUCERS

Authors
Citation
Ca. Rich et G. Slutzki, THE COMPLEXITY OF OPTIMIZING FINITE-STATE TRANSDUCERS, Theoretical computer science, 129(2), 1994, pp. 323-336
Citations number
7
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
ISSN journal
03043975
Volume
129
Issue
2
Year of publication
1994
Pages
323 - 336
Database
ISI
SICI code
0304-3975(1994)129:2<323:TCOOFT>2.0.ZU;2-5
Abstract
An optimizing finite-state transducer is a nondeterministic finite-sta te transducer in which states are either maximizing or minimizing. In a given state, the optimal output is the maximum or minimum - over all possible transitions - of the transition output concatenated with the optimal output of the resulting state. The ranges of optimizing finit e-state transducers form a class in NL which includes a hierarchy base d on the number of alternations of maximizing and minimizing states in a computation.