暂无分享,去创建一个
Hugo Gimbert | Youssouf Oualhadj | Nathanaël Fijalkow | Nathanaël Fijalkow | H. Gimbert | Y. Oualhadj
[1] Azaria Paz,et al. Probabilistic automata , 2003 .
[2] Thomas Colcombet,et al. Factorization forests for infinite words and applications to countable scattered linear orderings , 2010, Theor. Comput. Sci..
[3] Krishnendu Chatterjee,et al. Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..
[4] Marcel Paul Schützenberger,et al. On the Definition of a Family of Automata , 1961, Inf. Control..
[5] G. Lallement. Semigroups and combinatorial applications , 1979 .
[6] Mehryar Mohri,et al. Finite-State Transducers in Language and Speech Processing , 1997, CL.
[7] Imre Simon,et al. On Semigroups of Matrices over the Tropical Semiring , 1994, RAIRO Theor. Informatics Appl..
[8] Wen-Guey Tzeng,et al. A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata , 1992, SIAM J. Comput..
[9] Hugo Gimbert,et al. Probabilistic Automata on Finite Words: Decidable and Undecidable Problems , 2010, ICALP.
[10] Mehryar Mohri,et al. LP Distance and Equivalence of Probabilistic Automata , 2007, Int. J. Found. Comput. Sci..
[11] Sean R. Eddy,et al. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .
[12] Mariëlle Stoelinga,et al. An Introduction to Probabilistic Automata , 2002, Bull. EATCS.
[13] Krishnendu Chatterjee,et al. Algorithms for Omega-Regular Games with Incomplete Information ∗ , 2006 .
[14] Alberto Bertoni,et al. The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory , 1974, GI Jahrestagung.
[15] Mahesh Viswanathan,et al. Power of Randomization in Automata on Infinite Strings , 2009, CONCUR.
[16] Christel Baier,et al. Probabilistic ω-automata , 2012, JACM.
[17] Jarkko Kari,et al. Digital Images and Formal Languages , 1997, Handbook of Formal Languages.
[18] Christel Baier,et al. On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.
[19] Jérémie Chalopin,et al. On factorization forests of finite height , 2004, Theor. Comput. Sci..
[20] Richard J. Lipton,et al. On the complexity of space bounded interactive proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[21] Mehryar Mohri,et al. On the Computation of the Relative Entropy of Probabilistic Automata , 2008, Int. J. Found. Comput. Sci..
[22] J. Howie. Fundamentals of semigroup theory , 1995 .
[23] Dexter Kozen,et al. Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).