Skip to main content

Search results

(1 - 20 of 34)

Pages




Bookmarks:

Title: Preface
Subtitle: Special Issue: Descriptional Complexity of Formal Systems 2017
Source: International Journal of Foundations of Computer Science
Date: 2019
Author: Câmpeanu, Cezar; Pighizzini, Giovanni
Genre: Journal Article
Volume: 30
Issue: 06n07
Start Page: 827
DOI: 10.1142/S0129054119020039




Bookmarks:

Title: What is a Complex Regular Language?
Source: Journal of Automata, Languages and Combinatorics
Date: 2018
Author: Câmpeanu, Cezar
Genre: Journal Article
Volume: 23
Issue: 1-3
Start Page: 111




Bookmarks:

Title: Implementation and application of automata
Subtitle: 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings
Date: 2018
Genre: Book, Whole
Editor: Câmpeanu, Cezar
DOI: 10.1007/978-3-319-94812-6
ISBN: 978-3-319-94811-9
Publisher: Springer International Publishing




Bookmarks:

Title: Descriptional complexity of formal systems
Subtitle: 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings
Date: 2017
Genre: Book, Whole
Editor: Pighizzini, Giovanni; Câmpeanu, Cezar
DOI: 10.1007/978-3-319-60252-3
ISBN: 978-3-319-60252-3, 978-3-319-60251-6
Publisher: Springer International Publishing




Bookmarks:

Title: Blum’s and Burgin’s axioms, complexity, and randomness
Source: Information and Complexity
Date: 2017
Author: Câmpeanu, Cezar
Genre: Book, Section
Start Page: 33
DOI: https://doi.org/10.1142/9789813109032_0003




Bookmarks:

Title: Descriptional complexity of formal systems
Subtitle: 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania , July 5-8, 2016. Proceedings.
Date: 2016
Genre: Book, Whole
Editor: Câmpeanu, Cezar; Manea, Florin; Shallit, Jeffrey
DOI: 10.1007/978-3-319-41114-9
ISBN: 9783319411132; 978-3-319-41113-2
Publisher: Springer




Bookmarks:

Title: Nondeterministic tree width of regular languages
Source: Descriptional complexity of formal systems
Date: 2015
Author: Câmpeanu, Cezar; Salomaa, Kai
Genre: Book, Section
Start Page: 46
ISBN: 9783319192253




Bookmarks:

Title: Distinguishability operation on regular languages
Source: ArXiv
Date: 2014
Author: Campeanu, Cezar; Moreira, Nelma
Genre: Journal Article
Abstract: In this paper we study the language of the words that, for a given language L, distinguish between pairs of different left-quotients of L. We...
Volume: 1407.0160




Bookmarks:

Title: Simplifying nondeterministic finite cover automata
Source: arXiv
Date: 2014
Author: Câmpeanu, Cezar
Genre: Journal Article
Abstract: The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA '98, as a more compact representation than Deterministic Finite...
Volume: 1405.5601
DOI: 10.4204/EPTCS.151.11




Bookmarks:

Title: Descriptional complexity in encoded blum static complexity spaces
Source: International Journal of Foundations of Computer Science
Date: 2014
Author: Câmpeanu, Cezar
Genre: Journal Article
Abstract: Algorithmic Information Theory is based on the notion of descriptional complexity known as Chaitin-Kolmogorov complexity, defined in the '60s in...
Volume: 25
Issue: 7
Start Page: 917
DOI: 10.1142/S0129054114400152




Bookmarks:

Title: On the intersection of regex languages with regular languages
Source: Formal Languages and Applications: A Collection of Papers in Honor of Sheng Yu
Date: 2009
Author: Câmpeanu, Cezar; Santean, Nicolae
Genre: Journal Article
Volume: 410
Issue: 24-25
Start Page: 2336
DOI: 10.1016/j.tcs.2009.02.022




Bookmarks:

Title: Preface
Source: Descriptional Complexity of Formal Systems
Date: 2009
Author: Câmpeanu, Cezar; Pighizzini, Giovanni
Genre: Journal Article
Volume: 410
Issue: 35
Start Page: 3187
DOI: 10.1016/j.tcs.2009.05.015




Bookmarks:

Title: State complexity of the subword closure operation with applications to DNA coding
Source: International Journal of Foundations of Computer Science
Date: 2008
Author: Câmpeanu, Cezar; Konstantinidis, Stavros
Genre: Journal Article
Abstract: We are interested in the state complexity of languages that are defined via the subword closure operation. The subword closure of a set S of fixed...
Volume: 19
Issue: 5
Start Page: 1099
DOI: 10.1142/S0129054108006169




Bookmarks:

Title: An incremental algorithm for constructing minimal deterministic finite cover automata
Source: Implementation and application of automata
Date: 2006
Author: Campeanu, Cezar; Paun, Andrei; Smith, J. R.
Genre: Book, Section
Abstract: We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the DFCA for a language L can...
Start Page: 90
ISBN: 0302-9743




Bookmarks:

Title: Obtaining and separation of F-18 from (H2O)-O-18; obtaining of TEP images
Source: Revista de Chimie
Date: 2006
Author: Campeanu, Cezar; Racolta, P. M.; Nicolae, N.; Mihalcea, I.
Genre: Journal Article
Abstract: The nuclear reaction O-18 (d, 2n) F-18 and the separation of F-18 from the irradiated samples have been studied. For this reaction liquid H2O...
Volume: 57
Issue: 8
Start Page: 841




Bookmarks:

Title: Automata recognizing no words
Subtitle: A statistical approach
Source: Fundamenta Informaticae
Date: 2006
Author: Calude, Cristian S.; Campeanu, Cezar; Dumitrescu, Monica
Genre: Journal Article
Volume: 73
Issue: 1-2
Start Page: 1




Bookmarks:

Title: Incremental construction of minimal deterministic finite cover automata
Source: Theoretical Computer Science
Date: 2006
Author: Campeanu, Cezar; Paun, Andrei; Smith, Jason R.
Genre: Journal Article
Abstract: We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata (DFCA) for a given language. Since it was...
Volume: 363
Issue: 2
Start Page: 135
DOI: 10.1016/j.tcs.2006.07.020




Bookmarks:

Title: Tight bounds for NFA to DFCA transformations for binary alphabets
Source: Implementation and application of automata
Date: 2005
Author: Campeanu, Cezar; Paun, Andrei
Genre: Book, Section
Abstract: In this paper we prove a lower bound for the maximum state complexity of Deterministic Finite Cover Automata (DFCAs) obtained from Non...
Start Page: 306
ISBN: 0302-9743




Bookmarks:

Title: Results on transforming NFA into DFCA
Source: Fundamenta Informaticae
Date: 2005
Author: Campeanu, Cezar; Kari, L.; Paun, Andrei
Genre: Journal Article
Abstract: In this paper we consider the transformation from (minimal) non-deterministic finite automata (NFAs) to deterministic finite cover automata (DFCAs)...
Volume: 64
Issue: 1-4
Start Page: 53




Bookmarks:

Title: Computing beyond the Turing limit using the H systems
Source: DNA computing
Date: 2005
Author: Campeanu, Cezar; Puaun, Andrei
Genre: Book, Section
Abstract: We introduce a new variant of the heavily studied model of H systems. The new variant will use an external factor to determine the set of the...
Start Page: 24
DOI: 10.1007/11493785_3

Robertson Library

Search results

Pages

Pages

About UPEI

Academics

Current Students

Apply to UPEI

Research