Cezar Câmpeanu
Professor
Faculty of Sciences- Mathematical and Computational Sciences
University of Prince Edward Island
Canada
Biography
Dr Cezar did his PhD from Bucharest in 1995. He then did his PDF in Western University in 1997-1998 & in Queens University in 2001.
Research Interest
His Interest lies in Theory of computation: Formal Languages, Automata and Transducers, Descriptional complexity, decidability, and computability, Algorithmic Information Theory, Kolmogorov-Chaitin complexity, Bioinformatics and DNA Computation, Discrete mathematics in relation to computer science, Efficient implementation of algorithms and Quantum computing
Publications
-
Campeanu C, Moreira N. Distinguishability operation on regular languages. ArXiv. 2014;1407.
-
Câmpeanu C. Descriptional complexity in encoded blum static complexity spaces. International Journal of Foundations of Computer Science. 2014 Nov;25(07):917-32.
-
Câmpeanu C, Salomaa K. Nondeterministic tree width of regular languages. InInternational Workshop on Descriptional Complexity of Formal Systems 2015 Jun 25 (pp. 46-57). Springer, Cham.
-
Pighizzini G, Câmpeanu C. Descriptional Complexity of Formal Systems.
