BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Germany
1 × Hungary
2 × Canada
3 × France
Collaborated with:
A.Paun S.Yu K.Salomaa J.R.Smith S.Vágvölgyi N.Santean K.C.II
Talks about:
finit (6) cover (6) automata (5) languag (4) minim (4) determinist (2) construct (2) algorithm (2) number (2) regex (2)

Person: Cezar Câmpeanu

DBLP DBLP: C=acirc=mpeanu:Cezar

Contributed to:

AFL 20142014
CIAA 20132013
CIAA 20052005
CIAA 20042004
CIAA 20022002
DLT 20012001
CIAA 20002002
WIA 19991999
WIA 19981998

Wrote 10 papers:

AFL-2014-Campeanu #automaton #finite #nondeterminism
Simplifying Nondeterministic Finite Cover Automata (CC), pp. 162–173.
CIAA-2013-Campeanu #implementation
Cover Languages and Implementations (CC), p. 1.
CIAA-2005-CampeanuPS #algorithm #automaton #finite #incremental
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.
CIAA-2004-CampeanuP #automaton #bound #nondeterminism
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.
CIAA-2002-CampeanuP #automaton #finite #similarity
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata (CC, AP), pp. 67–76.
CIAA-2002-CampeanuSY #regular expression
Regex and Extended Regex (CC, KS, SY), pp. 77–84.
Shuffle Quotient and Decompositions (CC, KS, SV), pp. 186–196.
CIAA-J-2000-CampeanuPY02 #algorithm #automaton #finite #performance
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.
WIA-1999-CampeanuCSY #complexity #finite
State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.
WIA-1998-CampeanuSY #finite
Minimal Cover-Automata for Finite Languages (CC, NS, SY), pp. 43–56.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.