Cézar Câmpeanu

Degrees:

M.Sc., The University of Bucharest, Romania, 1988
Ph.D., The University of Bucharest, Romania, 1995

Position:

Associate Professor

Department:

Computer Science & Information Technology

Faculty:

Science

Phone:

(902) 566-0485

Email:

Email contact form

Link:

Personal Website

Research Interests:

Descriptional complexity of automata and of other objects that can be described using (formal) languages
Deciadbility and complexity of problems related to words and languages
Minimization of representations, and application to compression techniques

Citations:

Cristian Calude and Cezar Campeanu, Note on the topological structure
of random strings, TCS 112(1993), 383-390.
Cezar Campeanu, Nicolae Santean, and Sheng Yu, Minimal Cover-Automata for Finite Languages, TCS 267(2001), 3-16.
Cezar Campeanu, Nicolae Santean, and Sheng Yu, Mergible states in large NFA, TCS 330(2005), 23-24.
Cezar Campeanu and Sheng Yu, Pattern expressions and pattern automata, IPL 92 (2004), 267-274.
Cezar Campeanu, Kai Salomaa, and Sheng Yu, Tight Lower Bound for the State Complexity of Suffle of Regular Languages, JALC 7(2002), 303-310.

Current Collaborators (non-UPEI):

Current Collaborators (non-UPEI):

Sheng Yu (University of Western Ontario, Ontario, Canada)
Kai Salomaa (Queen's University, Ontario Canada)
Cristian Calude (University of Auckland, New Zealand)
Monica Dumitrescu (The University of Bucharest, Romania)