Cezar Campeanu

Description

Details

NameCezar Campeanu
PositionFaculty Member
Emailccampeanu@upei.ca
Department(s)Computer Science and Information Technology
Phone(902) 566-0485
BuildingCass Science Hall 405
Websitehttp://www.csit.upei.ca/~ccampeanu/

Cezar Campeanu

Biography

Title: Associate Professor

Education: Master in Computer Science, University of Bucharest (1988); Ph.D in Mathematics/Computer Science, University of Bucharest (1995); Postdoc in Computer Science, University of Western Ontario (1998); Postdoc in Computer Science, Queen's University (2001)

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 Citations


Subscribe to Cezar Campeanu's citation feed

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

Other Scholars in Computer Science and Information Technology

Citations

Step 1: Select your citations

TitleAuthor(s)
Distinguishability Operation On Regular LanguagesCampeanu, Cezar; Moreira, Nelma
Mergible states in large NFACampeanu, Cezar; Santean, Nicolae; Yu, Sheng
Tight bounds for NFA to DFCA transformations for binary alphabetsCampeanu, Cezar; Paun, Andrei
Obtaining and separation of F-18 from (H2O)-O-18; obtaining of TEP imagesCampeanu, Cezar; Racolta, P. M.; Nicolae, N.; Mihalcea, I.
An O(n2) algorithm for constructing minimal cover automata for finite languagesPuaun, Andrei; Santean, Nicolae; Yu, Sheng; Campeanu, Cezar
On the intersection of regex languages with regular languagesCâmpeanu, Cezar; Santean, Nicolae
Computing beyond the Turing limit using the H systemsCampeanu, Cezar; Puaun, Andrei
Incremental construction of minimal deterministic finite cover automataCampeanu, Cezar; Paun, Andrei; Smith, Jason R.
Regex and extended regexCampeanu, Cezar; Salomaa, K.; Yu, S.
Results on transforming NFA into DFCACampeanu, Cezar; Kari, L.; Paun, Andrei
Counting the number of minimal DFCA obtained by merging statesCampeanu, Cezar; Paun, Andrei
Automata recognizing no wordsCalude, Cristian S.; Campeanu, Cezar; Dumitrescu, Monica
Shuffle decompositions of regular languagesCampeanu, Cezar; Salomaa, K.; Vagvolgyi, S.
An incremental algorithm for constructing minimal deterministic finite cover automataCampeanu, Cezar; Paun, Andrei; Smith, J. R.
An efficient algorithm for constructing minimal cover automata for finite languagesCampeanu, Cezar; Paun, Andrei; Yu, Sheng
State complexity of regular languagesCampeanu, Cezar; Salomaa, Kai; Yu, Sheng
Tight lower bound for the state complexity of shuffle of regular languagesCampeanu, Cezar; Salomaa, Kai; Yu, Sheng
Note on the topological structure of ramdom stringsCalude, C.; Campeanu, Cezar
Minimal cover-automata for finite languagesCampeanu, Cezar; Santean, Nicolae; Yu, S.
A formal study of practical regular expressionsCampeanu, Cezar; Salomaa, Kai; Yu, Sheng
Shuffle quotient and decompositionsCampeanu, Cezar; Salomaa, K.; Vagvolgyi, S.
Pattern expressions and pattern automataCampeanu, Cezar; Yu, Sheng
The number of similarity relations and the number of minimal deterministic finite cover automataCampeanu, Cezar; Paun, Andrei
PrefaceCâmpeanu, Cezar; Pighizzini, Giovanni

Step 2: Preview or export the formatted citations

Theses

No citations found!

Metrics

TitleTimes viewedLast viewed
Distinguishability Operation On Regular Languages - ir:97084215:09:46 2014-10-30
Mergible states in large NFA - ir:ir-batch6-153437618:45:02 2014-10-30
Tight bounds for NFA to DFCA transformations for binary alphabets - ir:ir-batch6-153828615:13:32 2014-10-30
Obtaining and separation of F-18 from (H2O)-O-18; obtaining of TEP images - ir:ir-batch6-153536218:32:37 2014-10-29
An O(n2) algorithm for constructing minimal cover automata for finite languages - ir:ir-batch6-152627202:38:08 2014-10-26
On the intersection of regex languages with regular languages - ir:78636412:15:25 2014-10-30
Computing beyond the Turing limit using the H systems - ir:ir-batch6-152430416:16:59 2014-10-30
Incremental construction of minimal deterministic finite cover automata - ir:ir-batch6-152536615:14:42 2014-10-30
Regex and extended regex - ir:ir-batch6-154028411:48:52 2014-10-30
Results on transforming NFA into DFCA - ir:ir-batch6-153726411:59:47 2014-10-27
Counting the number of minimal DFCA obtained by merging states - ir:ir-batch6-152327314:53:02 2014-10-27
Automata recognizing no words - ir:ir-batch6-152732708:26:24 2014-10-28
Shuffle decompositions of regular languages - ir:ir-batch6-153026112:30:19 2014-10-27
An incremental algorithm for constructing minimal deterministic finite cover automata - ir:ir-batch6-153630418:45:22 2014-10-30
An efficient algorithm for constructing minimal cover automata for finite languages - ir:ir-batch6-152225714:43:19 2014-10-30
State complexity of regular languages - ir:ir-batch6-152828408:03:00 2014-10-26
Tight lower bound for the state complexity of shuffle of regular languages - ir:ir-batch6-153126414:03:28 2014-10-27
Note on the topological structure of ramdom strings - ir:ir-batch6-154228314:39:07 2014-10-28
Minimal cover-automata for finite languages - ir:ir-batch6-152928116:38:29 2014-10-30
A formal study of practical regular expressions - ir:ir-batch6-153226913:55:41 2014-10-30
Shuffle quotient and decompositions - ir:ir-batch6-154128403:20:26 2014-10-30
Pattern expressions and pattern automata - ir:ir-batch6-153327609:26:48 2014-10-29
The number of similarity relations and the number of minimal deterministic finite cover automata - ir:ir-batch6-153924002:45:31 2014-10-26
Preface - ir:78533609:58:44 2014-10-27