default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCezar Câmpeanu
Person information
- affiliation: University of Prince Edward Island, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Cezar Câmpeanu, Cezar A. Câmpeanu, Matthew Kozma:
Binary distinguishability operation. Theor. Comput. Sci. 1016: 114782 (2024)- 2023
- [j32]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: 113819 (2023) - 2021
- [j31]Cezar Câmpeanu:
Two Extensions of Cover Automata. Axioms 10(4): 338 (2021) - [j30]Galina Jirásková, Cezar Câmpeanu:
Special Issue on Implementation and Application of Automata. Theor. Comput. Sci. 870: 1-2 (2021) - 2020
- [j29]Cezar Câmpeanu:
Implementations and Applications of Automata 2018: Preface. Int. J. Found. Comput. Sci. 31(8): 979-982 (2020)
2010 – 2019
- 2019
- [j28]Cezar Câmpeanu, Giovanni Pighizzini:
Preface. Int. J. Found. Comput. Sci. 30(6-7): 827-829 (2019) - 2018
- [j27]Cezar Câmpeanu:
What is a Complex Regular Language? J. Autom. Lang. Comb. 23(1-3): 111-126 (2018) - [e4]Cezar Câmpeanu:
Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings. Lecture Notes in Computer Science 10977, Springer 2018, ISBN 978-3-319-94811-9 [contents] - 2017
- [j26]Cezar Câmpeanu, Florin Manea, Giovanni Pighizzini, Jeffrey O. Shallit:
Preface. J. Autom. Lang. Comb. 22(1-3): 3-4 (2017) - [c22]Cezar Câmpeanu:
State complexity of distinguishability combined with union operation. NCMA 2017: 87-101 - [e3]Giovanni Pighizzini, Cezar Câmpeanu:
Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings. Lecture Notes in Computer Science 10316, Springer 2017, ISBN 978-3-319-60251-6 [contents] - 2016
- [j25]Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
Distinguishability Operations and Closures. Fundam. Informaticae 148(3-4): 243-266 (2016) - [c21]Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
On the dissimilarity operation on finite languages. NCMA 2016: 105-120 - [e2]Cezar Câmpeanu, Florin Manea, Jeffrey O. Shallit:
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings. Lecture Notes in Computer Science 9777, Springer 2016, ISBN 978-3-319-41113-2 [contents] - 2015
- [j24]Cezar Câmpeanu:
Non-Deterministic Finite Cover Automata. Sci. Ann. Comput. Sci. 25(1): 3-28 (2015) - [c20]Cezar Câmpeanu, Kai Salomaa:
Nondeterministic Tree Width of Regular Languages. DCFS 2015: 46-57 - 2014
- [j23]Cezar Câmpeanu:
Descriptional Complexity in encoded Blum Static Complexity Spaces. Int. J. Found. Comput. Sci. 25(7): 917- (2014) - [c19]Cezar Câmpeanu:
Topological Properties in Encoded Blum Universal Static Complexity Spaces. Discrete Mathematics and Computer Science 2014: 89-101 - [c18]Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
The distinguishability operation on regular languages. NCMA 2014: 85-100 - [c17]Cezar Câmpeanu:
Simplifying Nondeterministic Finite Cover Automata. AFL 2014: 162-173 - [i1]Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
The Distinguishability Operation On Regular Languages. CoRR abs/1407.0160 (2014) - 2013
- [c16]Cezar Câmpeanu:
Blum Static Complexity and Encoding Spaces. DCFS 2013: 1-13 - [c15]Cezar Câmpeanu:
Cover Languages and Implementations. CIAA 2013: 1 - 2012
- [j22]Cezar Câmpeanu:
Randomness in Blum Universal Static Complexity Spaces. J. Autom. Lang. Comb. 17(2-4): 107-122 (2012) - [c14]Cezar Câmpeanu:
A Note on Blum Static Complexity Measures. Computation, Physics and Beyond 2012: 71-80 - [c13]Cezar Câmpeanu:
Randomness Behaviour in Blum Universal Static Complexity Spaces. DCFS 2012: 130-140
2000 – 2009
- 2009
- [j21]Cezar Câmpeanu, Nicolae Santean:
On the closure of pattern expressions languages under intersection with regular languages. Acta Informatica 46(3): 193-207 (2009) - [j20]Cezar Câmpeanu, Nicolae Santean:
On the intersection of regex languages with regular languages. Theor. Comput. Sci. 410(24-25): 2336-2344 (2009) - [j19]Cezar Câmpeanu, Giovanni Pighizzini:
Preface. Theor. Comput. Sci. 410(35): 3187 (2009) - 2008
- [j18]Cezar Câmpeanu, Stavros Konstantinidis:
State Complexity of the Subword Closure Operation with Applications to DNA Coding. Int. J. Found. Comput. Sci. 19(5): 1099-1112 (2008) - [e1]Cezar Câmpeanu, Giovanni Pighizzini:
10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008. University of Prince Edward Island 2008, ISBN 978-0-919013-56-8 [contents] - 2007
- [j17]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
A Family of NFAs Free of State Reductions. J. Autom. Lang. Comb. 12(1-2): 69-78 (2007) - 2006
- [j16]Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu:
Automata Recognizing No Words: A Statistical Approach. Fundam. Informaticae 73(1-2): 1-18 (2006) - [j15]Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363(2): 135-148 (2006) - [c12]Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS 2006: 223-231 - 2005
- [j14]Cezar Câmpeanu, Lila Kari, Andrei Paun:
Results on Transforming NFA into DFCA. Fundam. Informaticae 64(1-4): 53-63 (2005) - [j13]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Mergible states in large NFA. Theor. Comput. Sci. 330(1): 23-34 (2005) - [c11]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Large NFA Without Mergeable States. DCFS 2005: 75-84 - [c10]Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA 2005: 90-103 - 2004
- [j12]Cezar Câmpeanu, Sheng Yu:
Pattern expressions and pattern automata. Inf. Process. Lett. 92(6): 267-274 (2004) - [j11]Cezar Câmpeanu, Wing Hong Ho:
The Maximum State Complexity for Finite Languages. J. Autom. Lang. Comb. 9(2/3): 189-202 (2004) - [c9]Cezar Câmpeanu, Andrei Paun:
Lower bounds for NFA to DCFA Transformations. DCFS 2004: 121-130 - [c8]Cezar Câmpeanu, Andrei Paun:
Computing Beyond the Turing Limit Using the H Systems. DNA 2004: 24-34 - [c7]Cezar Câmpeanu, Andrei Paun:
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. CIAA 2004: 306-307 - 2003
- [j10]Cezar Câmpeanu, Andrei Paun:
Counting The Number Of Minimal Dfca Obtained By Merging States. Int. J. Found. Comput. Sci. 14(6): 995-1006 (2003) - [j9]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003) - 2002
- [j8]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): 83-97 (2002) - [j7]Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi:
Shuffle Decompositions of Regular Languages. Int. J. Found. Comput. Sci. 13(6): 799-816 (2002) - [j6]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): 303-310 (2002) - [c6]Cezar Câmpeanu:
How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l? DCFS 2002: 70-80 - [c5]Cezar Câmpeanu, Andrei Paun:
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. CIAA 2002: 67-76 - [c4]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
Regex and Extended Regex. CIAA 2002: 77-84 - 2001
- [j5]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2): 3-16 (2001) - [c3]Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi:
Shuffle Quotient and Decompositions. Developments in Language Theory 2001: 186-196 - 2000
- [p1]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
State Complexity of Regular Languages: Finite versus Infinite. Finite Versus Infinite 2000: 53-73
1990 – 1999
- 1999
- [c2]Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu:
State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70 - 1998
- [c1]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56 - 1996
- [j4]Cristian Calude, Cezar Câmpeanu:
Are binary codings universal? Complex. 1(5): 47-50 (1996) - [j3]Cezar Câmpeanu:
Random Numbers Are Borel Normal. Bull. EATCS 58 (1996) - 1994
- [j2]Cezar Câmpeanu:
Random Numbers. Sci. Ann. Cuza Univ. 3: 53-64 (1994) - 1993
- [j1]Cristian Calude, Cezar Câmpeanu:
Note on the Topological Structure of Random Strings. Theor. Comput. Sci. 112(2): 383-390 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
