# Cezar Câmpeanu

According to our database

Collaborative distances:

^{1}, Cezar Câmpeanu authored at least 48 papers between 1993 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

What is a Complex Regular Language?

Journal of Automata, Languages and Combinatorics, 2018

2017

Preface.

Journal of Automata, Languages and Combinatorics, 2017

State complexity of distinguishability combined with union operation.

Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

2016

Distinguishability Operations and Closures.

Fundam. Inform., 2016

On the dissimilarity operation on finite languages.

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015

Non-Deterministic Finite Cover Automata.

Sci. Ann. Comp. Sci., 2015

Nondeterministic Tree Width of Regular Languages.

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

Descriptional Complexity in encoded Blum Static Complexity Spaces.

Int. J. Found. Comput. Sci., 2014

Simplifying Nondeterministic Finite Cover Automata.

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

The distinguishability operation on regular languages.

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Topological Properties in Encoded Blum Universal Static Complexity Spaces.

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

Cover Languages and Implementations.

Proceedings of the Implementation and Application of Automata, 2013

Blum Static Complexity and Encoding Spaces.

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

Randomness in Blum Universal Static Complexity Spaces.

Journal of Automata, Languages and Combinatorics, 2012

Randomness Behaviour in Blum Universal Static Complexity Spaces.

Proceedings of the Descriptional Complexity of Formal Systems, 2012

A Note on Blum Static Complexity Measures.

Proceedings of the Computation, Physics and Beyond, 2012

2009

On the intersection of regex languages with regular languages.

Theor. Comput. Sci., 2009

Preface.

Theor. Comput. Sci., 2009

On the closure of pattern expressions languages under intersection with regular languages.

Acta Inf., 2009

2008

State Complexity of the Subword Closure Operation with Applications to DNA Coding.

Int. J. Found. Comput. Sci., 2008

2007

A Family of NFAs Free of State Reductions.

Journal of Automata, Languages and Combinatorics, 2007

2006

Incremental construction of minimal deterministic finite cover automata.

Theor. Comput. Sci., 2006

Automata Recognizing No Words: A Statistical Approach.

Fundam. Inform., 2006

Tight Bounds for the State Complexity of Deterministic Cover Automata.

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Mergible states in large NFA.

Theor. Comput. Sci., 2005

Results on Transforming NFA into DFCA.

Fundam. Inform., 2005

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata.

Proceedings of the Implementation and Application of Automata, 2005

Large NFA Without Mergeable States.

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004

The Maximum State Complexity for Finite Languages.

Journal of Automata, Languages and Combinatorics, 2004

Pattern expressions and pattern automata.

Inf. Process. Lett., 2004

Tight Bounds for NFA to DFCA Transformations for Binary Alphabets.

Proceedings of the Implementation and Application of Automata, 2004

Computing Beyond the Turing Limit Using the H Systems.

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Lower bounds for NFA to DCFA Transformations.

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003

A Formal Study Of Practical Regular Expressions.

Int. J. Found. Comput. Sci., 2003

Counting The Number Of Minimal Dfca Obtained By Merging States.

Int. J. Found. Comput. Sci., 2003

2002

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.

Journal of Automata, Languages and Combinatorics, 2002

Shuffle Decompositions of Regular Languages.

Int. J. Found. Comput. Sci., 2002

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.

Int. J. Found. Comput. Sci., 2002

Regex and Extended Regex.

Proceedings of the Implementation and Application of Automata, 2002

The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata.

Proceedings of the Implementation and Application of Automata, 2002

How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l?

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001

Shuffle Quotient and Decompositions.

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

1999

State Complexity of Basic Operations on Finite Languages.

Proceedings of the Automata Implementation, 1999

1998

Minimal Cover-Automata for Finite Languages.

Proceedings of the Automata Implementation, 1998

1996

Random Numbers Are Borel Normal.

Bulletin of the EATCS, 1996

Are binary codings universal?

Complexity, 1996

1994

Random Numbers.

Sci. Ann. Cuza Univ., 1994

1993

Note on the Topological Structure of Random Strings.

Theor. Comput. Sci., 1993