Biography

Professor


MSc, PhD (Bucharest)


Dr. Câmpeanu researches the theory of computing and works to describe efficiently a complex object by providing consistent information and eliminating redundancies. This philosophy, to compress information, carries through to his investigations into languages which may result in improved software packages that could be written faster and with fewer errors.

Recent Publications

What is a Complex Regular Language?

Journal of Automata, Languages and Combinatorics, 2018

Descriptional complexity of formal systems

, 2017

Descriptional complexity of formal systems

, 2016

Nondeterministic tree width of regular languages

Descriptional complexity of formal systems, 2015

Descriptional complexity in encoded blum static complexity spaces

International Journal of Foundations of Computer Science, 2014

Research Classification

  • No classification given

Research Interests

  • 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
  • Quantum computing
Subscribe to Cezar Campeanu RSS feed

Bookmarks: