The Removal of Weighted ε-Transitions
作者： Sylvain Lombardy , Jacques Sakarovitch
DOI: 10.1007/978-3-642-31606-7_31
关键词: Automaton 、 Computer science 、 Discrete mathematics
摘要: The removal of e-transitions in weighted automata leads to infinite summation when cycles such transitions are allowed. This paper presents both an algorithm for that purpose, and a framework which the is correct.
springer.com
archives-ouvertes.fr
springerlink.com参考文章(9)
Arto Salomaa, Werner Kuich, Semirings, Automata and Languages Springer-Verlag New York, Inc.. ,(1985)
Jean Berstel, Christophe Reutenauer, Rational Series and Their Languages ,(1988)
Jean Berstel, Christophe Reutenauer, Les séries rationnelles et leurs langages Masson. ,(1984)
Jacques Sakarovitch, Elements of Automata Theory ,(2009)
Jacques Sakarovitch, Rational and Recognisable Power Series Handbook of Weighted Automata. pp. 105- 174 ,(2009) , 10.1007/978-3-642-01492-5_4
Arto Salomaa, Werner Kuich, Semirings, Automata, Languages ,(2011)
MEHRYAR MOHRI, GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS International Journal of Foundations of Computer Science. ,vol. 13, pp. 129- 143 ,(2002) , 10.1142/S0129054102000996
Sylvain Lombardy, Jacques Sakarovitch, Derivatives of rational expressions with multiplicity Theoretical Computer Science. ,vol. 332, pp. 141- 177 ,(2005) , 10.1016/J.TCS.2004.10.016
Dominique Perrin, Finite automata Handbook of theoretical computer science (vol. B). pp. 1- 57 ,(1991)