作者: Mehryar Mohri , Cyril Allauzen
DOI:
关键词: Mathematics 、 Transducer 、 Original Device 、 Algorithm 、 Edge (geometry) 、 Automaton 、 State (computer science) 、 Finite-state machine 、 Property (programming) 、 Inverse
摘要: Finite-state transducers and weighted finite-state automata may not be determinizable. The twins property can used to characterize the determinizability of such devices. For a automaton or transducer, that transducer its inverse are intersected composed, respectively. resulting device is checked determine if it has cycle-identity property. If not, original unweighted functional. That then composed with inverse. every edge in having cycle-accessible end state meets at least one number conditions. so, property,