back


Full Papers in Refereed Journals

  1. Cezar Câmpeanu, Nelma Moreira, Rogério Reis, Distinguishability Operations and Closures on Regular Languages, sumbmitted to Fundamenta Informaticae, November 2014.
  2. Cezar Câmpeanu, Nondeterministic Finite Cover Automata, Scientific Annals of Cuza University, XXV (1) 2015, 3-28.
  3. Cezar Câmpeanu, Descriptional Complexity in Encoded Blum Static Complexity Spaces. International Journal of Foundations of Computer Science, World Scientific Volume 25, issue 7, November 2014, 917-932.
  4. Cezar Câmpeanu, Randomness in Blum Universal Static Complexity Spaces, Journal of Automata, Languages and Combinatorics, 17 (2012) 2-4, 107-122.
  5. Cezar Câmpeanu, Nicolae Sântean, On the Closure of Pattern Expressions Languages under Intersection with Regular Languages , Acta Informatica, 46(3), 193-207, 2009
  6. Cezar Câmpeanu, Nicolae Sântean, On the intersection of regex with regular languages , Theoretical Computer Science, Elsevier Science Publishers Ltd. Essex, UK, Volume 410 Issue 24-25, May, 2009
  7. Cezar Câmpeanu, Stavros Konstantinidis, State complexity of the subword closure operation with applications to DNA coding. International Journal of Foundations of Computer Science 19:5, 1099-1112, 2008.
  8. Cezar Câmpeanu, Nicolae Sântean, and Sheng Yu, A Family of NFAs Free of State Reductions, Journal of Automata, Languages and Combinatorics, 12, 1/2, 2007.
  9. Cezar Câmpeanu, Andrei Paun, and Jacob Smith, An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata, Theoretical Computer Science 363(2), 135-148, 2006.
  10. Cezar Câmpeanu, Cristian Calude, and Monica Dumitrescu, Automata Recognizing No Words: A Statistical Approach, Fundamenta Informaticae vol 73 no. 1-2, 1-18, 2006.
  11. Cezar Câmpeanu, Lila Kari, and Andrei Paun, Results on Transforming NFA into DFCA, Fundamenta Informaticae, vol 64, no. 1-4, 53-63, 2005.
  12. Cezar Câmpeanu, Nicolae Sântean, and Sheng Yu, Mergible States in Large NFAs, Theoretical Computer Science, 330(1), 23-34, 2005.
  13. Cezar Câmpeanu and Sheng Yu, Pattern Expressions and Pattern Automata , Information Processing Letters (IPL), 92(6), 267 - 274, 2004.
  14. Cezar Câmpeanu and Wing Hong Ho, The Maximum State Complexity for Finite Languages, Journal of Automata, Languages and Combinatorics, Vol. 9, No 2/3, 189-202, 2004.
  15. Cezar Câmpeanu, Kai Salomaa, and Sheng Yu, A Formal Study of Practical Regular Expressions, International Journal of Foundations of Computer Science, Vol. 14, No 6, 1007 - 1018, December 2003.
  16. Cezar Câmpeanu and Andrei Paun, Counting The Number of Minimal DFCA Obtained by Merging States, International Journal of Foundations of Computer Science, Vol. 14, No 6, 995 - 1006, December 2003.
  17. Cezar Câmpeanu, Kai Salomaa, and S. Vágvölgy, Shuffle decompositions of regular languages, International Journal of Foundations of Computer Science, Vol. 13, No. 6, 799 - 816, 2002.
  18. Cezar Câmpeanu, Kai Salomaa, and Sheng Yu, Tight Lower bound for the State Complexity of Shuffle of Regular Languages, Journal of Automata, Languages and Combinatorics, Vol. 7, No. 3, 303 - 310, 2002.
  19. Cezar Câmpeanu, Andrei Paun, and Sheng Yu, An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages, International Journal of Foundations of Computer Science Vol 13, 1, 83 - 97, February 2002.
  20. Cezar Câmpeanu, Nicolae Sântean, and Sheng Yu, Finite Languages and Cover Automata, Theoretical Computer Science, 267, 1-2, 3 - 16, 2001.

  21. Cezar Câmpeanu, Complexity of Simulation. A Note, Analele Univ. Bucuresti, Mat-Inf. 1, 25 - 28, 1996.

  22. Cezar Câmpeanu, Random numbers are Borel Normal, European Association for Theoretical Computer Science Bull. 58, 155 - 158, 1996.
  23. Cristian Calude and Cezar Câmpeanu, Are Binary Codes Universal?, ``Complexity'' (Wiley), 1(5), 1 - 11, 1996.
  24. Cezar Câmpeanu, Random numbers, Scientific Annals of University ``Al.I. Cuza'' of Iasi Computer Science III, 53 - 64, 1994.
  25. Cezar Câmpeanu, Chaitin's Representability of Martin-Löf Tests, Analele Univ. Bucuresti, Mat-Inf., 80 - 83, 1993-1994.
  26. Cristian Calude and Cezar Câmpeanu, Note on the topological structure of random strings, Theoretical Computer Science, 112, 383 - 390, 1993.
  27. Cezar Câmpeanu, The Post correspondence problem. A new proof, St. Cerc. Math., 41, 4, 225 - 235, 1989.
  28. Cezar Câmpeanu, Semiautomata, outer measures, and Carathéodory property, Analele Univ. Bucuresti, Mat, 27 2, 52 - 55, 1988.
  29. Cezar Câmpeanu, Regular languages and programming languages, Revue Roumaine de Linguistique - CLTA, 23, 7 - 10, 1986.

back