Note on the Topological Structure of Random Strings. - Cristian Calude; Cezar Câmpeanu (Theor. Comput. Sci., 1993)

Random Numbers. - Cezar Câmpeanu (Sci. Ann. Cuza Univ., 1994)

Are binary codings universal? - Cristian Calude; Cezar Câmpeanu (Complex., 1996)

Random Numbers Are Borel Normal. - Cezar Câmpeanu (Bull. EATCS, 1996)

State Complexity of Basic Operations on Finite Languages. - Cezar Câmpeanu; Karel Culík II; Kai Salomaa; Sheng Yu 001 (WIA, 1999)

State Complexity of Regular Languages: Finite versus Infinite. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (Finite Versus Infinite, 2000)

Shuffle Quotient and Decompositions. - Cezar Câmpeanu; Kai Salomaa; Sándor Vágvölgyi (Developments in Language Theory, 2001)

Minimal cover-automata for finite languages. - Cezar Câmpeanu; Nicolae Santean; Sheng Yu 001 (Theor. Comput. Sci., 2001)

How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l? - Cezar Câmpeanu (DCFS, 2002)

The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. - Cezar Câmpeanu; Andrei Paun (CIAA, 2002)

Regex and Extended Regex. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (CIAA, 2002)

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. - Cezar Câmpeanu; Andrei Paun; Sheng Yu 001 (Int. J. Found. Comput. Sci., 2002)

Shuffle Decompositions of Regular Languages. - Cezar Câmpeanu; Kai Salomaa; Sándor Vágvölgyi (Int. J. Found. Comput. Sci., 2002)

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (J. Autom. Lang. Comb., 2002)

Counting The Number Of Minimal Dfca Obtained By Merging States. - Cezar Câmpeanu; Andrei Paun (Int. J. Found. Comput. Sci., 2003)

A Formal Study Of Practical Regular Expressions. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (Int. J. Found. Comput. Sci., 2003)

Lower bounds for NFA to DCFA Transformations. - Cezar Câmpeanu; Andrei Paun (DCFS, 2004)

Computing Beyond the Turing Limit Using the H Systems. - Cezar Câmpeanu; Andrei Paun (DNA, 2004)

Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. - Cezar Câmpeanu; Andrei Paun (CIAA, 2004)

Pattern expressions and pattern automata. - Cezar Câmpeanu; Sheng Yu 001 (Inf. Process. Lett., 2004)

The Maximum State Complexity for Finite Languages. - Cezar Câmpeanu; Wing Hong Ho (J. Autom. Lang. Comb., 2004)

Large NFA Without Mergeable States. - Cezar Câmpeanu; Nicolae Santean; Sheng Yu 001 (DCFS, 2005)

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. - Cezar Câmpeanu; Andrei Paun; Jason R. Smith 002 (CIAA, 2005)

Results on Transforming NFA into DFCA. - Cezar Câmpeanu; Lila Kari; Andrei Paun (Fundam. Informaticae, 2005)

Mergible states in large NFA. - Cezar Câmpeanu; Nicolae Santean; Sheng Yu 001 (Theor. Comput. Sci., 2005)

Tight Bounds for the State Complexity of Deterministic Cover Automata. - Cezar Câmpeanu; Andrei Paun; Jason R. Smith 002 (DCFS, 2006)

Automata Recognizing No Words: A Statistical Approach. - Cristian S. Calude; Cezar Câmpeanu; Monica Dumitrescu (Fundam. Informaticae, 2006)

Incremental construction of minimal deterministic finite cover automata. - Cezar Câmpeanu; Andrei Paun; Jason R. Smith 002 (Theor. Comput. Sci., 2006)

A Family of NFAs Free of State Reductions. - Cezar Câmpeanu; Nicolae Santean; Sheng Yu 001 (J. Autom. Lang. Comb., 2007)

State Complexity of the Subword Closure Operation with Applications to DNA Coding. - Cezar Câmpeanu; Stavros Konstantinidis (Int. J. Found. Comput. Sci., 2008)

On the closure of pattern expressions languages under intersection with regular languages. - Cezar Câmpeanu; Nicolae Santean (Acta Informatica, 2009)

Preface. - Cezar Câmpeanu; Giovanni Pighizzini (Theor. Comput. Sci., 2009)

On the intersection of regex languages with regular languages. - Cezar Câmpeanu; Nicolae Santean (Theor. Comput. Sci., 2009)

A Note on Blum Static Complexity Measures. - Cezar Câmpeanu (Computation, Physics and Beyond, 2012)

Randomness Behaviour in Blum Universal Static Complexity Spaces. - Cezar Câmpeanu (DCFS, 2012)

Randomness in Blum Universal Static Complexity Spaces. - Cezar Câmpeanu (J. Autom. Lang. Comb., 2012)

Blum Static Complexity and Encoding Spaces. - Cezar Câmpeanu (DCFS, 2013)

Cover Languages and Implementations. - Cezar Câmpeanu (CIAA, 2013)

Topological Properties in Encoded Blum Universal Static Complexity Spaces. - Cezar Câmpeanu (Discrete Mathematics and Computer Science, 2014)

The distinguishability operation on regular languages. - Cezar Câmpeanu; Nelma Moreira; Rogério Reis (NCMA, 2014)

Simplifying Nondeterministic Finite Cover Automata. - Cezar Câmpeanu (AFL, 2014)

Descriptional Complexity in encoded Blum Static Complexity Spaces. - Cezar Câmpeanu (Int. J. Found. Comput. Sci., 2014)

Nondeterministic Tree Width of Regular Languages. - Cezar Câmpeanu; Kai Salomaa (DCFS, 2015)

Non-Deterministic Finite Cover Automata. - Cezar Câmpeanu (Sci. Ann. Comput. Sci., 2015)

On the dissimilarity operation on finite languages. - Cezar Câmpeanu; Nelma Moreira; Rogério Reis (NCMA, 2016)

Distinguishability Operations and Closures. - Cezar Câmpeanu; Nelma Moreira; Rogério Reis (Fundam. Informaticae, 2016)

State complexity of distinguishability combined with union operation. - Cezar Câmpeanu (NCMA, 2017)

Preface. - Cezar Câmpeanu; Florin Manea; Giovanni Pighizzini; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2017)

What is a Complex Regular Language? - Cezar Câmpeanu (J. Autom. Lang. Comb., 2018)

Implementations and Applications of Automata 2018: Preface. - Cezar Câmpeanu (Int. J. Found. Comput. Sci., 2020)

Two Extensions of Cover Automata. - Cezar Câmpeanu (Axioms, 2021)

Special Issue on Implementation and Application of Automata. - Galina Jirásková; Cezar Câmpeanu (Theor. Comput. Sci., 2021)

Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude). - Alastair A. Abbott; Cezar Câmpeanu; Ludwig Staiger; Marius Zimand; Arto Salomaa (Theor. Comput. Sci., 2023)

Binary distinguishability operation. - Cezar Câmpeanu; Cezar A. Câmpeanu; Matthew Kozma (Theor. Comput. Sci., 2024)