Zhe Dang, Ph.D.
Affiliations: | 2000 | University of California, Santa Barbara, Santa Barbara, CA, United States |
Google:
"Zhe Dang"Parents
Sign in to add mentor| Tevfik Bultan | grad student | 2000 | UC Santa Barbara | |
| (Debugging and verification of infinite state real -time systems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Cui C, Dang Z, Fischer TR, et al. (2017) Information rate of some classes of non-regular languages: An automata-theoretic approach Information & Computation. 256: 45-61 |
| Cui C, Dang Z, Fischer TR, et al. (2013) Execution information rate for some classes of automata Information and Computation |
| Cui C, Dang Z, Fischer TR. (2011) Typical Paths of a Graph Fundamenta Informaticae. 110: 95-109 |
| Yang L, Dang Z, Ibarra OH. (2010) Bond computing systems: A biologically inspired and high-level dynamics model for pervasive computing Natural Computing. 9: 347-364 |
| Ibarra OH, Dang Z, Yang L. (2008) On counter machines, reachability problems, and Diophantine equations International Journal of Foundations of Computer Science. 19: 919-934 |
| Ibarra OH, Dang Z. (2006) On the solvability of a class of diophantine equations and applications Theoretical Computer Science. 352: 342-346 |
| Dang Z, Ibarra OH. (2005) On one-membrane P systems operating in sequential mode International Journal of Foundations of Computer Science. 16: 867-881 |
| Ibarra OH, Yen HC, Dang Z. (2005) On various notions of parallelism in P systems International Journal of Foundations of Computer Science. 16: 683-705 |
| Dang Z, Ibarra OH, Su J. (2005) On composition and lookahead delegation of e-services modeled by automata Theoretical Computer Science. 341: 344-363 |
| Dang Z, Ibarra OH, Sun ZW. (2005) On two-way nondeterministic finite automata with one reversal-bounded counter Theoretical Computer Science. 330: 59-79 |