Ad Astra Awards
Ad Astra Journal
Science library
White book
University rankings
Who's who
Theses and dissertations
Ad Astra association
Press releases
Funding opportunities
>> Românã

Cezar Campeanu

Universitatea din Bucuresti, Bucharest, Romania

Institution web page:
Personal web page:
Send email

Born: 1965

Interests: Automata, Formal Languages, Descriptional Complexity, Theory of Computation, Algorithmic Information Theory

Formal Languages, Finite automata, Cover automata, minimization algorithms, regular expressions, state complexity, Chaitin-Kolmogorov Complexity

Selected publications:
• Cezar Campeanu, Andrei Paun, Jason R. Smith. An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. Theoretical Computer Science, 363(2), pp. 135-148, 2006.
• Cristian S. Calude, Cezar Campeanu, Monica Dumitrescu. Automata Recognizing No Words: A Statistical Approach. . Fundamenta Informaticae, 73, pp. 1 - 18, 2006.
• Cezar Campeanu, Nicolae Santean, and Sheng Yu. Mergible states in large NFA. Theoretical Computer Science, 330 Issue 1, pp. 23-34, 2005.
• Cezar Campeanu, Lila Kari, Andrei Paun. Results on Transforming NFA into DFCA. Fundamenta Informaticae, 64, Number 1-4, pp. 53 - 63, 2005.
• Cezar Campeanu, Sheng Yu. Pattern expressions and pattern automata. Information Processing Letters, 92 Issue 6, pp. 267-274, 2004.
• CEZAR CAMPEANU, ANDREI PAUN. COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES. International Journal of Foundations of Computer Science, 14, No. 6, pp. 995-1006, 2003.
• CEZAR CAMPEANU, KAI SALOMAA, SHENG YU. A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS. International Journal of Foundations of Computer Science, 14, No. 6, pp. 1007-1018, 2003.

Publications from the ISI database, indexed between 2002-2011, produced in Romania:
• Calude, CS; Campeanu, C; Dumitrescu, M, Automata recognizing no words: A statistical approach. FUNDAMENTA INFORMATICAE, 73 (1-2), pp. 1-18, 2006.
More information


© Ad Astra 2001-2013