Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models. - Haiming Chen 001; Ping Lu 007 (APWeb, 2011)

Deciding Determinism of Unary Languages Is coNP-Complete. - Ping Lu 007; Feifei Peng; Haiming Chen 001 (Developments in Language Theory, 2013)

Checking determinism of regular expressions with counting. - Haiming Chen 001; Ping Lu 007 (Inf. Comput., 2015)

Deciding determinism of unary languages. - Ping Lu 007; Feifei Peng; Haiming Chen 001; Lixiao Zheng (Inf. Comput., 2015)

Deciding Determinism of Regular Languages. - Ping Lu 007; Joachim Bremer; Haiming Chen 001 (Theory Comput. Syst., 2015)

Derivatives and Finite Automata of Expressions in Star Normal Form. - Haiming Chen 001; Ping Lu 007 (LATA, 2017)

The Complexity of SORE-definability Problems. - Ping Lu 007; Zhilin Wu; Haiming Chen 001 (MFCS, 2017)

Towards an Effective Syntax and a Generator for Deterministic Standard Regular Expressions. - Zhiwu Xu 001; Ping Lu 007; Haiming Chen 001 (Comput. J., 2019)

Grammars and a Random Generator for Deterministic Chain Regular Expressions. - Xinyu Chu; Ping Lu 007; Haiming Chen 001 (SOFSEM (Doctoral Student Research Forum), 2020)