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: C=acirc=mpeanu:Cezar
Contributed to:
2014
2013200520042002
2001200219991998Wrote 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.
- DLT-2001-CampeanuSV
- 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.