暂无分享,去创建一个
[1] Martin Kutrib,et al. Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata , 2010, RP.
[2] Christian Choffrut,et al. Uniformization of Rational Relations , 1999, Jewels are Forever.
[3] Olivier Carton,et al. Unambiguous Büchi automata , 2003, Theor. Comput. Sci..
[4] Thomas Colcombet. Unambiguity in Automata Theory , 2015, DCFS.
[5] Harry B. Hunt,et al. On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata , 1985, SIAM J. Comput..
[6] E. Seneta. Non-negative Matrices and Markov Chains , 2008 .
[7] Giovanni Pighizzini,et al. Two-Way Finite Automata: Old and Recent Results , 2012, Fundam. Informaticae.
[8] Christof Löding,et al. Efficient inclusion testing for simple classes of unambiguous ω-automata , 2012, Inf. Process. Lett..
[9] P. Halmos. Lectures on Boolean Algebras , 1963 .
[10] Christof Löding,et al. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata , 2010, LATA.
[11] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[12] C. Reutenauer,et al. Noncommutative Rational Series with Applications , 2010 .
[13] Jacques Sakarovitch,et al. Elements of Automata Theory , 2009 .