Cezar Câmpeanu

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 10

Top Topics

Regular Languages

Finite Automata

Topological Properties

Top Venues

Int. J. Found. Comput. Sci.

J. Autom. Lang. Comb.

Publications

Alastair A. Abbott, Cezar Câmpeanu, Ludwig Staiger, Marius Zimand, Arto Salomaa
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude). Theor. Comput. Sci. 952 (2023)
Galina Jirásková, Cezar Câmpeanu
Special Issue on Implementation and Application of Automata. Theor. Comput. Sci. 870 (2021)
Cezar Câmpeanu
Two Extensions of Cover Automata. Axioms 10 (4) (2021)
Cezar Câmpeanu
Implementations and Applications of Automata 2018: Preface. Int. J. Found. Comput. Sci. 31 (8) (2020)
Cezar Câmpeanu, Giovanni Pighizzini
Preface. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Cezar Câmpeanu
What is a Complex Regular Language? J. Autom. Lang. Comb. 23 (1-3) (2018)
Cezar Câmpeanu
State complexity of distinguishability combined with union operation. NCMA (2017)
Cezar Câmpeanu, Florin Manea, Giovanni Pighizzini, Jeffrey O. Shallit
Preface. J. Autom. Lang. Comb. 22 (1-3) (2017)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
Distinguishability Operations and Closures. Fundam. Informaticae 148 (3-4) (2016)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
On the dissimilarity operation on finite languages. NCMA (2016)
Cezar Câmpeanu, Kai Salomaa
Nondeterministic Tree Width of Regular Languages. DCFS (2015)
Cezar Câmpeanu
Non-Deterministic Finite Cover Automata. Sci. Ann. Comput. Sci. 25 (1) (2015)
Cezar Câmpeanu
Descriptional Complexity in encoded Blum Static Complexity Spaces. Int. J. Found. Comput. Sci. 25 (7) (2014)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
The distinguishability operation on regular languages. NCMA (2014)
Cezar Câmpeanu
Topological Properties in Encoded Blum Universal Static Complexity Spaces. Discrete Mathematics and Computer Science (2014)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
The Distinguishability Operation On Regular Languages. CoRR (2014)
Cezar Câmpeanu
Simplifying Nondeterministic Finite Cover Automata. AFL (2014)
Cezar Câmpeanu
Cover Languages and Implementations. CIAA (2013)
Cezar Câmpeanu
Blum Static Complexity and Encoding Spaces. DCFS (2013)
Cezar Câmpeanu
Randomness in Blum Universal Static Complexity Spaces. J. Autom. Lang. Comb. 17 (2-4) (2012)
Cezar Câmpeanu
Randomness Behaviour in Blum Universal Static Complexity Spaces. DCFS (2012)
Cezar Câmpeanu
A Note on Blum Static Complexity Measures. Computation, Physics and Beyond (2012)
Cezar Câmpeanu, Nicolae Santean
On the intersection of regex languages with regular languages. Theor. Comput. Sci. 410 (24-25) (2009)
Cezar Câmpeanu, Giovanni Pighizzini
Preface. Theor. Comput. Sci. 410 (35) (2009)
Cezar Câmpeanu, Nicolae Santean
On the closure of pattern expressions languages under intersection with regular languages. Acta Informatica 46 (3) (2009)
Cezar Câmpeanu, Stavros Konstantinidis
State Complexity of the Subword Closure Operation with Applications to DNA Coding. Int. J. Found. Comput. Sci. 19 (5) (2008)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
A Family of NFAs Free of State Reductions. J. Autom. Lang. Comb. 12 (1-2) (2007)
Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu
Automata Recognizing No Words: A Statistical Approach. Fundam. Informaticae 73 (1-2) (2006)
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363 (2) (2006)
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS (2006)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Mergible states in large NFA. Theor. Comput. Sci. 330 (1) (2005)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Large NFA Without Mergeable States. DCFS (2005)
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA (2005)
Cezar Câmpeanu, Lila Kari, Andrei Paun
Results on Transforming NFA into DFCA. Fundam. Informaticae 64 (1-4) (2005)
Cezar Câmpeanu, Andrei Paun
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. CIAA (2004)
Cezar Câmpeanu, Wing Hong Ho
The Maximum State Complexity for Finite Languages. J. Autom. Lang. Comb. 9 (2/3) (2004)
Cezar Câmpeanu, Andrei Paun
Lower bounds for NFA to DCFA Transformations. DCFS (2004)
Cezar Câmpeanu, Andrei Paun
Computing Beyond the Turing Limit Using the H Systems. DNA (2004)
Cezar Câmpeanu, Sheng Yu
Pattern expressions and pattern automata. Inf. Process. Lett. 92 (6) (2004)
Cezar Câmpeanu, Andrei Paun
Counting The Number Of Minimal Dfca Obtained By Merging States. Int. J. Found. Comput. Sci. 14 (6) (2003)
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14 (6) (2003)
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. J. Autom. Lang. Comb. 7 (3) (2002)
Cezar Câmpeanu, Andrei Paun
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. CIAA (2002)
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
Shuffle Decompositions of Regular Languages. Int. J. Found. Comput. Sci. 13 (6) (2002)
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) (2002)
Cezar Câmpeanu
How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l? DCFS (2002)
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
Regex and Extended Regex. CIAA (2002)
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
Shuffle Quotient and Decompositions. Developments in Language Theory (2001)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Minimal cover-automata for finite languages. Theor. Comput. Sci. 267 (1-2) (2001)
Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu
State Complexity of Basic Operations on Finite Languages. WIA (1999)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata (1998)
Cezar Câmpeanu
Random Numbers Are Borel Normal. Bull. EATCS 58 (1996)
Cristian Calude, Cezar Câmpeanu
Are binary codings universal? Complex. 1 (5) (1996)
Cezar Câmpeanu
Random Numbers. Sci. Ann. Cuza Univ. 3 (1994)
Cristian Calude, Cezar Câmpeanu
Note on the Topological Structure of Random Strings. Theor. Comput. Sci. 112 (2) (1993)