back


Full Papers in Refereed Proceedings or Collections

  1. Cezar Câmpeanu and Kai Salomaa, Nondeterministic Tree Width of Regular Languages LNCS 9118, Springer 2015, 46 -- 57.
  2. Cezar Câmpeanu, Topological Properties in Encoded Blum Universal Static Complexity Spaces, Gh. Paun, G. Rozenberg, A. Salomaa, eds., Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005), Editura Academiei, Bucuresti (The Publishing House of the Romanian Academy, Bucharest), 2014, ISBN 978-973-27-2470-5.
  3. Cezar Câmpeanu, Nelma Moreira, Rogério Reis, The Distinguishability Operation and on Regular Languages, Proceedings of NCMA 2014, July 28-29, Kassel Germany, Austrian Computer Society, Suna Bensch, Rudolf Freund, and Friedrich Otto (eds), July 2014, 85-100.
  4. Cezar Câmpeanu, Simplifying Nondeterministic Finite Automata, EPTCS 151-AFL 2014, May 27 - 29, 2014, 162-173.
  5. Cezar Câmpeanu, Cover Languages and Implementations, LNCS Vol 7982, 2013, CIAA 2013: 1pp.
  6. Cezar Câmpeanu, Blum Static Complexity and Encoding Spaces, LNCS Vol 8031, 2013, DCFS 2013: 1-13.
  7. Cezar Câmpeanu, Randomness Behaviour in Blum Universal Static Complexity Spaces, Proceedings of DCFS 2012, LNCS, vol 7386, 2012, 130-140.
  8. Cezar Câmpeanu, A note on Blum Static Complexity Measures, Computation, Physics and Beyond, LNCS Festschrift proceedings, vol 7160, Dinneen, Michael J.; Khoussainov, Bakhadyr; Nies, Prof. Andre (Eds.) 2012, 71-80.
  9. Cezar Câmpeanu, Andrei Păun and Jason R. Smith, Tight bounds for the state complexity of deterministic cover automata Proceedings of DFCS 2006, Las Cruces, New Mexico, USA, June 21-23, 2006.
  10. Cezar Câmpeanu, Andrei Păun and Jason R. Smith, An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata, Proceedings of CIAA 2005, (June 27-29), Lecture Notes in Computer Science, Vol. 3845, 90 - 103, 2006.
  11. Cezar Câmpeanu, Kai Salomaa, and Sheng Yu, Regex and extended regex, Proceedings of CIAA 2002 (July 3-5), 81-91, Lecture Notes in Computer Science, Vol. 2608, 77 - 84, 2003.
  12. Cezar Câmpeanu and Andrei Păun, The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata, Proceedings of CIAA 2002 (August 21-24), 71-81, Lecture Notes in Computer Science, Vol. 2608, 67 - 76, 2003.
  13. Cezar Câmpeanu, How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to $l$?, Proceedings of DFCS 2002, London Ontario, Canada, 70 - 80, 2002.
  14. Cezar Câmpeanu, Kai Salomaa, and S. Vágvölgyi, Shuffle quotient and decompositions, Proceedings of Developments in Language Theory, 5th International Conference, DLT2001, Wien, 16- 21 July (2001) 183 - 194, Lecture Notes in Computer Science 2295, Springer-Verlag, 53 - 73, 2002.
  15. Cezar Câmpeanu, Karel Culik II, Kai Salomaa, and Sheng Yu, State Complexity of Basic Operations on Finite Languages, Proc. Fourth International Workshop in Implementing Automata, WIA'99, VIII 1-11, Potsdam 1999, Lecture Notes in Computer Science, 2214, Springer Verlag, 60 - 70, 2001.
  16. Cezar Câmpeanu, Nicolae Sântean, and Sheng Yu, Minimal Cover-Automata for Finite Languages Proc. Third International Workshop in Implementing Automata, WIA'98, Rouen 1998, Lecture Notes in Computer Science, 1660, Springer Verlag, Berlin, 33 - 42, 1999.
  17. Cezar Câmpeanu, Random numbers, Proceedings of ROSYCS'93, Iasi, 10 pp, 1993.
  18. Cezar Câmpeanu, Note on Kolmogorov and Chaitin random strings, in A. Atanasiu, C. Calude (eds.), Salodays in Computer Science, Hyperion Press, Bucharest, 8 pp, 1992.

back