GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
From MaRDI portal
Publication:3021943
DOI10.1142/S0129054102000996zbMath1066.68070MaRDI QIDQ3021943
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
finite automatasemiringsrational power seriesfinite-state transducersshortest-paths algorithms\(\varepsilon\)-removal
Related Items
Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA, PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA, OpenFst: A General and Efficient Weighted Finite-State Transducer Library, Parametric Language Analysis of the Class of Stop-and-Wait Protocols, ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA, A note on probabilistic models over strings: the linear algebra approach, EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS, Kernel methods for learning languages, Algorithmic probabilistic game semantics. Playing games with automata, Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization, THE VALIDITY OF WEIGHTED AUTOMATA, Diagnosis and Automata