BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
2 × Canada
2 × France
2 × USA
Collaborated with:
C.Câmpeanu S.Yu B.Popa M.Paun A.Rodríguez-Patón J.R.Smith N.Santean
Talks about:
minim (5) automata (4) finit (4) cover (4) construct (3) algorithm (3) determinist (2) membran (2) languag (2) number (2)

Person: Andrei Paun

DBLP DBLP: Paun:Andrei

Facilitated 1 volumes:

CIAA 2000Ed

Contributed to:

CIAA 20082008
DLT 20062006
CIAA 20052005
CIAA 20042004
CIAA 20022002
CIAA 20002000
CIAA 20002002

Wrote 7 papers:

CIAA-2008-PaunPR #question
Hopcroft’s Minimization Technique: Queues or Stacks? (AP, MP, ARP), pp. 78–91.
DLT-2006-PaunP
P Systems with Proteins on Membranes and Membrane Division (AP, BP), pp. 292–303.
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-2000-PaunSY #algorithm #automaton #finite
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.
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.
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.