Finite-Valued Weighted Automata
暂无分享,去创建一个
[1] Daniel Krob,et al. The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..
[2] Shuji Jimbo,et al. Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata , 2002, Int. J. Algebra Comput..
[3] A. Sh. Nepomnjashchaja. Decidability of the Equivalence Problem for Synchronous Deterministic Pushdown Automata , 1984, MFCS.
[4] Christian Choffrut,et al. Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles , 1977, Theor. Comput. Sci..
[5] Krishnendu Chatterjee,et al. Quantitative languages , 2008, TOCL.
[6] Stephan Merz,et al. Model Checking , 2000 .
[7] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .
[8] Daniel Kirsten,et al. Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata , 2009, STACS.
[9] Ines Klimann,et al. Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton , 2004, Theor. Comput. Sci..
[10] Rodrigo de Souza. On the Decidability of the Equivalence for k-Valued Transducers , 2008, Developments in Language Theory.
[11] Jean-François Raskin,et al. Quantitative Languages Defined by Functional Automata , 2011, CONCUR.
[12] Gregory F. Sullivan,et al. Detecting cycles in dynamic graphs in polynomial time , 1988, STOC '88.
[13] Helmut Seidl,et al. Equivalence of finite-valued tree transducers is decidable , 1994, Mathematical systems theory.
[14] Timothy V. Griffiths. The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.
[15] Jacques Sakarovitch,et al. Lexicographic Decomposition of k-Valued Transducers , 2010, Theory of Computing Systems.
[16] Eitan M. Gurari,et al. A note on finite-valued and finitely ambiguous transducers , 1983, Mathematical systems theory.
[17] Véronique Bruyère,et al. Secure equilibria in weighted games , 2014, CSL-LICS.
[18] Krishnendu Chatterjee,et al. Multi-objective Discounted Reward Verification in Graphs and MDPs , 2013, LPAR.
[19] Andreas Weber. Finite-Valued Distance Automata , 1994, Theor. Comput. Sci..
[20] Andreas Weber,et al. On the valuedness of finite transducers , 1990, Acta Informatica.
[21] Thomas A. Henzinger,et al. Determinizing Discounted-Sum Automata , 2011, CSL.
[22] Jacques Sakarovitch,et al. On the Decidability of Bounded Valuedness for Transducers , 2008, MFCS.
[23] M. Droste,et al. Handbook of Weighted Automata , 2009 .
[24] Rodrigo de Souza,et al. A Combinatorial Study of k-Valued Rational Relations , 2008, J. Autom. Lang. Comb..