Cezar Câmpeanu
Orcid: 0000-0002-9777-3012Affiliations:
- University of Prince Edward Island, Canada
According to our database1,
Cezar Câmpeanu
authored at least 53 papers
between 1993 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on csit.upei.ca
On csauthors.net:
Bibliography
2023
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude).
Theor. Comput. Sci., March, 2023
2021
Theor. Comput. Sci., 2021
2020
Int. J. Found. Comput. Sci., 2020
2018
2017
State complexity of distinguishability combined with union operation.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017
2016
On the dissimilarity operation on finite languages.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016
2015
Proceedings of the Descriptional Complexity of Formal Systems, 2015
2014
Int. J. Found. Comput. Sci., 2014
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
Proceedings of the Implementation and Application of Automata, 2013
Proceedings of the Descriptional Complexity of Formal Systems, 2013
2012
Proceedings of the Descriptional Complexity of Formal Systems, 2012
Proceedings of the Computation, Physics and Beyond, 2012
2009
Theor. Comput. Sci., 2009
On the closure of pattern expressions languages under intersection with regular languages.
Acta Informatica, 2009
2008
Int. J. Found. Comput. Sci., 2008
2007
2006
Theor. Comput. Sci., 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
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
Proceedings of the Implementation and Application of Automata, 2004
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
Int. J. Found. Comput. Sci., 2003
2002
J. Autom. Lang. Comb., 2002
Int. J. Found. Comput. Sci., 2002
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
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
2000
Proceedings of the Finite Versus Infinite, 2000
1999
Proceedings of the Automata Implementation, 1999
1996
Random Numbers Are Borel Normal.
Bull. EATCS, 1996
1994
Random Numbers.
Sci. Ann. Cuza Univ., 1994
1993