Cezar Câmpeanu

63 papers B 1C 7Journal 35Unranked 16
YearRankTypeTitle / Venue / Authors
2026 J jnl
State complexity of side and rim operations.
Theor. Comput. Sci.
Cezar Câmpeanu
2025 — conf
Binary Right-Distinguishability Operation.
Languages of Cooperation and Communication
Cezar Câmpeanu
2024 J jnl
Binary distinguishability operation.
Theor. Comput. Sci.
Cezar Câmpeanu, Cezar A. Câmpeanu, Matthew Kozma
2023 J jnl
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude).
Theor. Comput. Sci.
Alastair A. Abbott, Cezar Câmpeanu, Ludwig Staiger, Marius Zimand, Arto Salomaa
2021 J jnl
Special Issue on Implementation and Application of Automata.
Theor. Comput. Sci.
Galina Jirásková, Cezar Câmpeanu
2021 J jnl
Two Extensions of Cover Automata.
Axioms
Cezar Câmpeanu
2020 J jnl
Implementations and Applications of Automata 2018: Preface.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu
2019 J jnl
Preface.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Giovanni Pighizzini
2018 C ed.
Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings
CIAA
Cezar Câmpeanu
2018 J jnl
What is a Complex Regular Language?
J. Autom. Lang. Comb.
Cezar Câmpeanu
2017 — ed.
Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings
DCFS
Giovanni Pighizzini, Cezar Câmpeanu
2017 J jnl
Preface.
J. Autom. Lang. Comb.
Cezar Câmpeanu, Florin Manea, Giovanni Pighizzini, Jeffrey O. Shallit
2017 — conf
State complexity of distinguishability combined with union operation.
NCMA
Cezar Câmpeanu
2016 — ed.
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings
DCFS
Cezar Câmpeanu, Florin Manea, Jeffrey O. Shallit
2016 J jnl
Distinguishability Operations and Closures.
Fundam. Informaticae
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2016 — conf
On the dissimilarity operation on finite languages.
NCMA
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2015 J jnl
Non-Deterministic Finite Cover Automata.
Sci. Ann. Comput. Sci.
Cezar Câmpeanu
2015 — conf
Nondeterministic Tree Width of Regular Languages.
DCFS
Cezar Câmpeanu, Kai Salomaa
2014 J jnl
Descriptional Complexity in encoded Blum Static Complexity Spaces.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu
2014 — conf
Simplifying Nondeterministic Finite Cover Automata.
AFL
Cezar Câmpeanu
2014 J jnl
The Distinguishability Operation On Regular Languages.
CoRR
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2014 — conf
The distinguishability operation on regular languages.
NCMA
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2014 — conf
Topological Properties in Encoded Blum Universal Static Complexity Spaces.
Discrete Mathematics and Computer Science
Cezar Câmpeanu
2013 — conf
Blum Static Complexity and Encoding Spaces.
DCFS
Cezar Câmpeanu
2013 C conf
Cover Languages and Implementations.
CIAA
Cezar Câmpeanu
2012 — conf
A Note on Blum Static Complexity Measures.
Computation, Physics and Beyond
Cezar Câmpeanu
2012 — conf
Randomness Behaviour in Blum Universal Static Complexity Spaces.
DCFS
Cezar Câmpeanu
2012 J jnl
Randomness in Blum Universal Static Complexity Spaces.
J. Autom. Lang. Comb.
Cezar Câmpeanu
2009 J jnl
On the closure of pattern expressions languages under intersection with regular languages.
Acta Informatica
Cezar Câmpeanu, Nicolae Santean
2009 J jnl
On the intersection of regex languages with regular languages.
Theor. Comput. Sci.
Cezar Câmpeanu, Nicolae Santean
2009 J jnl
Preface.
Theor. Comput. Sci.
Cezar Câmpeanu, Giovanni Pighizzini
2008 — ed.
10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008.
DCFS
Cezar Câmpeanu, Giovanni Pighizzini
2008 J jnl
State Complexity of the Subword Closure Operation with Applications to DNA Coding.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Stavros Konstantinidis
2007 J jnl
A Family of NFAs Free of State Reductions.
J. Autom. Lang. Comb.
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2006 J jnl
Automata Recognizing No Words: A Statistical Approach.
Fundam. Informaticae
Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu
2006 J jnl
Incremental construction of minimal deterministic finite cover automata.
Theor. Comput. Sci.
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
2006 — conf
Tight Bounds for the State Complexity of Deterministic Cover Automata.
DCFS
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
2005 C conf
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata.
CIAA
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
2005 — conf
Large NFA Without Mergeable States.
DCFS
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2005 J jnl
Mergible states in large NFA.
Theor. Comput. Sci.
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2005 J jnl
Results on Transforming NFA into DFCA.
Fundam. Informaticae
Cezar Câmpeanu, Lila Kari, Andrei Paun
2004 B conf
Computing Beyond the Turing Limit Using the H Systems.
DNA
Cezar Câmpeanu, Andrei Paun
2004 — conf
Lower bounds for NFA to DCFA Transformations.
DCFS
Cezar Câmpeanu, Andrei Paun
2004 J jnl
Pattern expressions and pattern automata.
Inf. Process. Lett.
Cezar Câmpeanu, Sheng Yu
2004 J jnl
The Maximum State Complexity for Finite Languages.
J. Autom. Lang. Comb.
Cezar Câmpeanu, Wing Hong Ho
2004 C conf
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets.
CIAA
Cezar Câmpeanu, Andrei Paun
2003 J jnl
A Formal Study Of Practical Regular Expressions.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
2003 J jnl
Counting The Number Of Minimal Dfca Obtained By Merging States.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Andrei Paun
2002 J jnl
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Andrei Paun, Sheng Yu
2002 — conf
How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l?
DCFS
Cezar Câmpeanu
2002 C conf
Regex and Extended Regex.
CIAA
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
2002 J jnl
Shuffle Decompositions of Regular Languages.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
2002 C conf
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata.
CIAA
Cezar Câmpeanu, Andrei Paun
2002 J jnl
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.
J. Autom. Lang. Comb.
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
2001 J jnl
Minimal cover-automata for finite languages.
Theor. Comput. Sci.
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2001 C conf
Shuffle Quotient and Decompositions.
Developments in Language Theory
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
2000 — ch.
State Complexity of Regular Languages: Finite versus Infinite.
Finite Versus Infinite
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
1999 — conf
State Complexity of Basic Operations on Finite Languages.
WIA
Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu
1998 — conf
Minimal Cover-Automata for Finite Languages.
Workshop on Implementing Automata
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
1996 J jnl
Are binary codings universal?
Complex.
Cristian Calude, Cezar Câmpeanu
1996 J jnl
Random Numbers Are Borel Normal.
Bull. EATCS
Cezar Câmpeanu
1994 J jnl
Random Numbers.
Sci. Ann. Cuza Univ.
Cezar Câmpeanu
1993 J jnl
Note on the Topological Structure of Random Strings.
Theor. Comput. Sci.
Cristian Calude, Cezar Câmpeanu