1. Formal specification and model-checking of CSMA/CA using finite precision timed automata;Li;The Journal of China Universities of Posts and Telecommunications,2005
2. On behavior of two dimensional cellular automata with an exceptional rule under periodic boundary condition;Zhong;The Journal of China Universities of Posts and Telecommunications,2010
3. On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata;Hromkovič;Information and Computation,2001
4. Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations. Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS’97), Feb 27−Mar 1, 1997, Lübeck, Germany;ĎuriŠ,1997
5. Self-verifying nondeter-ministic and Las Vegas multihead finite automata;Inoue;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,2001