Selected Publications:
 "On Deciding Readiness and Failure Equivalences for Processes",
(with Lu Tian), Information and Computation 117, pp. 193205, 1995.
 "Deciding Branching Bisimilarity of Normed ContextFree Processes
Is in Sigma(2)", (with D. Caucal and L. Tian), Information and
Computation 118, pp. 306315, 1995.
 "A note on the Complexity of Deciding Bisimilarity of Normed Unary
Processes", (with Lu Tian), Theoretical Computer Science 131,
pp. 441448, 1994.
 "On Deciding Some Equivalences for Concurrent Processes",
(with Lu Tian), RAIRO Theoretical Informatics and Applications 27,
pp. 5171, 1994.
 "Deciding Bisimilarity of Normed ContextFree Processes is in
Sigma(2)", (with Lu Tian), Theoretical Computer Science 123,
pp. 183197, 1994.
 "On Deciding Readiness and Failure Equivalences for Processes",
(with Lu Tian), to appear in Information and Computation.
 "On the Rearrangeability of Switching Networks Composed of Digital
Symmetrical Matrices", (with Hai Nguyen), Proc. 5th Intern. Conf.
on Computing and Information, pp. 155159, Sudbury, Canada, 1993.
 "On the Complexity of Bisimilarity of Normed Probabilistic ContextFree
Processes", (with Lu Tian), Proc. 5th Intern. Conf. on Computing
and Information, pp. 37, Sudbury, Canada, 1993.
 "On Deciding Trace Equivalence for Processes", (with Lu Tian),
Information Sciences 72, pp. 105121, 1993.
 "The Complexity of Deciding Code and Monoid Properties for Regular
Sets", International Journal of Algebra and Computation, Vol.
2, pp. 3955, 1992.
 "On Some Equivalence Relations for Probabilistic Processes",
(with Lu Tian), Fundamenta Informaticae 17, pp. 211234, 1992.
 "NonUniform Complexity and the Randomness of Certain Complete
Languages", Theoretical Computer Science, Vol. 96, pp. 305324,
1992.
 "The Parallel Complexity of Coarsest Set Partition Problems",
(with Sang Cho), Information Processing Letters, Vol. 42, pp. 8994,
1992.
 "Efficient Detectors and Constructors for Simple Languages",
International Journal of Foundations of Computer Sciences, Vol.
2, pp. 183205, 1992.
 "The Parallel Complexity of Finite State Automata Problems",
(with Sang Cho), Information and Computation, Vol. 97, pp. 122,
1992.
 "The Effective Entropies of Some Extensions of ContextFree Languages",
Information Processing Letters, Vol. 37, pp. 165169, 1991.
 "A Note on Separating DeterministicTimeComplexity Classes, and
on AlmostEverywhere Complex Sets", (with J. Geske and J. Seifera),
Information and Computation, Vol. 92, pp. 97104, 1991.
 "Finite Automaton Aperiodicity is PSPACEComplete",
(with Sang Cho), Theoretical Computer Science, Vol. 88, pp. 99116,
1991.
 "Effective Entropies and Data Compression", Information
and Computation, Vol. 90, pp. 6785, 1991.
