Cezar Câmpeanu

	2012
34		Cezar Câmpeanu: A Note on Blum Static Complexity Measures. Computation, Physics and Beyond 2012: 71-80
	2009
33		Cezar Câmpeanu, Nicolae Santean: On the closure of pattern expressions languages under intersection with regular languages. Acta Inf. 46(3): 193-207 (2009)
32		Cezar Câmpeanu, Nicolae Santean: On the intersection of regex languages with regular languages. Theor. Comput. Sci. 410(24-25): 2336-2344 (2009)
31		Cezar Câmpeanu, Giovanni Pighizzini: Preface. Theor. Comput. Sci. 410(35): 3187 (2009)
	2008
30		Cezar Câmpeanu, Giovanni Pighizzini: 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008. University of Prince Edward Island 2008
29		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
28		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
27		Cezar Câmpeanu, Andrei Paun, Jason R. Smith: Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS 2006: 223-231
26		Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu: Automata Recognizing No Words: A Statistical Approach. Fundam. Inform. 73(1-2): 1-18 (2006)
25		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
24		Cezar Câmpeanu, Andrei Paun, Jason R. Smith: An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA 2005: 90-103
23		Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Large NFA Without Mergeable States. DCFS 2005: 75-84
22		Cezar Câmpeanu, Lila Kari, Andrei Paun: Results on Transforming NFA into DFCA. Fundam. Inform. 64(1-4): 53-63 (2005)
21		Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Mergible states in large NFA. Theor. Comput. Sci. 330(1): 23-34 (2005)
	2004
20		Cezar Câmpeanu, Andrei Paun: Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. CIAA 2004: 306-307
19		Cezar Câmpeanu, Andrei Paun: Lower bounds for NFA to DCFA Transformations. DCFS 2004: 121-130
18		Cezar Câmpeanu, Andrei Paun: Computing Beyond the Turing Limit Using the H Systems. DNA 2004: 24-34
17		Cezar Câmpeanu, Sheng Yu: Pattern expressions and pattern automata. Inf. Process. Lett. 92(6): 267-274 (2004)
16		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
15		Cezar Câmpeanu, Kai Salomaa, Sheng Yu: A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003)
14		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
13		Cezar Câmpeanu, Andrei Paun: The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. CIAA 2002: 67-76
12		Cezar Câmpeanu, Kai Salomaa, Sheng Yu: Regex and Extended Regex. CIAA 2002: 77-84
11		Cezar Câmpeanu: How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l? DCFS 2002: 70-80
10		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		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		Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi: Shuffle Quotient and Decompositions. Developments in Language Theory 2001: 186-196
6		Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2): 3-16 (2001)
	1999
5		Cezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu: State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70
	1998
4		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)

Coauthor Index

1	Cristian S. Calude (Cristian Calude)	[1] [26]
2	Karel Culik II	[5]
3	Monica Dumitrescu	[26]
4	Wing Hong Ho	[16]
5	Lila Kari (Lila Santean)	[22]
6	Stavros Konstantinidis	[29]
7	Andrei Paun	[10] [13] [14] [18] [19] [20] [22] [24] [25] [27]
8	Giovanni Pighizzini	[30] [31]
9	Kai Salomaa	[5] [7] [8] [9] [12] [15]
10	Nicolae Santean	[4] [6] [21] [23] [28] [32] [33]
11	Jason R. Smith	[24] [25] [27]
12	Sándor Vágvölgyi	[7] [9]
13	Sheng Yu	[4] [5] [6] [8] [10] [12] [15] [17] [21] [23] [28]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page