• CSV Spreadsheet
  • RSS Feed
(1 - 20 of 30)

Pages

Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
Bookmarks:
Title
Mergible states in large NFA
Source
Theoretical Computer Science
Date
2005
Author
Campeanu, Cezar; Santean, Nicolae; Yu, Sheng
Genre
Journal Article
Abstract
Quite often, trivial problems stated for deterministic finite automata (DFA) are surprisingly difficult for the non-deterministic case (NFA). In...
Volume
330
Issue
1
Start Page
23
DOI
10.1016/j.tcs.2004.09.008
Get it at UPEI
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
Get it at UPEI
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
Get it at UPEI
Bookmarks:
Title
Pattern expressions and pattern automata
Source
Information Processing Letters
Date
2004
Author
Campeanu, Cezar; Yu, Sheng
Genre
Journal Article
Abstract
We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of...
Volume
92
Issue
6
Start Page
267
DOI
10.1016/j.ipl.2004.09.007
Get it at UPEI
Bookmarks:
Title
The number of similarity relations and the number of minimal deterministic finite cover automata
Source
Implementation and Application of Automata
Date
2003
Author
Campeanu, Cezar; Paun, Andrei
Genre
Conference Proceedings
Volume
2608
Start Page
67
ISBN
3540403914
Get it at UPEI
Bookmarks:
Title
A formal study of practical regular expressions
Source
International Journal of Foundations of Computer Science
Date
2003
Author
Campeanu, Cezar; Salomaa, Kai; Yu, Sheng
Genre
Journal Article
Abstract
Regular expressions are used in many practical applications. Practical regular expressions are commonly called "regex". It is known that regex are...
Volume
14
Issue
6
Start Page
1007
DOI
10.1142/S012905410300214X

Pages