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