The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Cezar Câmpeanu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
    Shuffle Quotient and Decompositions. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:186-196 [Conf]
  2. Cezar Câmpeanu, Andrei Paun
    Computing Beyond the Turing Limit Using the H Systems. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:24-34 [Conf]
  3. Cezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu
    State Complexity of Basic Operations on Finite Languages. [Citation Graph (0, 0)][DBLP]
    WIA, 1999, pp:60-70 [Conf]
  4. Cezar Câmpeanu, Andrei Paun
    The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:67-76 [Conf]
  5. Cezar Câmpeanu, Andrei Paun
    Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:306-307 [Conf]
  6. Cezar Câmpeanu, Andrei Paun, Jason R. Smith
    An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:90-103 [Conf]
  7. Cezar Câmpeanu, Kai Salomaa, Sheng Yu
    Regex and Extended Regex. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:77-84 [Conf]
  8. Cezar Câmpeanu, Nicolae Santean, Sheng Yu
    Minimal Cover-Automata for Finite Languages. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:43-56 [Conf]
  9. Cezar Câmpeanu
    Random Numbers. [Citation Graph (0, 0)][DBLP]
    Sci. Ann. Cuza Univ., 1994, v:3, n:, pp:53-64 [Journal]
  10. Cezar Câmpeanu
    Random Numbers Are Borel Normal. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1996, v:58, n:, pp:- [Journal]
  11. Cezar Câmpeanu, Lila Kari, Andrei Paun
    Results on Transforming NFA into DFCA. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:53-63 [Journal]
  12. Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu
    Automata Recognizing No Words: A Statistical Approach. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:1-18 [Journal]
  13. Cezar Câmpeanu, Andrei Paun
    Counting The Number Of Minimal Dfca Obtained By Merging States. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:995-1006 [Journal]
  14. Cezar Câmpeanu, Andrei Paun, Sheng Yu
    An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:83-97 [Journal]
  15. Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
    Shuffle Decompositions of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:6, pp:799-816 [Journal]
  16. Cezar Câmpeanu, Kai Salomaa, Sheng Yu
    A Formal Study Of Practical Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1007-1018 [Journal]
  17. Cezar Câmpeanu, Sheng Yu
    Pattern expressions and pattern automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:6, pp:267-274 [Journal]
  18. Cezar Câmpeanu, Kai Salomaa, Sheng Yu
    Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:3, pp:303-310 [Journal]
  19. Cezar Câmpeanu, Andrei Paun, Jason R. Smith
    Incremental construction of minimal deterministic finite cover automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:135-148 [Journal]
  20. Cezar Câmpeanu, Nicolae Santean, Sheng Yu
    Minimal cover-automata for finite languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:267, n:1-2, pp:3-16 [Journal]
  21. Cezar Câmpeanu, Nicolae Santean, Sheng Yu
    Mergible states in large NFA. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:23-34 [Journal]
  22. Cristian Calude, Cezar Câmpeanu
    Note on the Topological Structure of Random Strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:112, n:2, pp:383-390 [Journal]

  23. On the closure of pattern expressions languages under intersection with regular languages. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002