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:
1 × Australia
1 × Austria
1 × Czech Republic
1 × Greece
1 × Italy
1 × Sweden
1 × Taiwan
2 × USA
3 × France
3 × Germany
3 × Spain
4 × Canada
Collaborated with:
K.Salomaa A.Salomaa Y.Gao C.Câmpeanu N.Santean ∅ A.Paun X.Wu B.Cui L.Kari H.Lu J.Ma Y.Han J.Zan M.Domaratzki J.Shallit C.Calude A.Mateescu G.Liu C.Martín-Vide K.C.II S.Huerter T.Jiang
Talks about:
languag (13) state (12) complex (10) finit (9) oper (8) combin (6) automata (4) minim (4) cover (4) regular (3)

Person: Sheng Yu

DBLP DBLP: Yu:Sheng

Facilitated 8 volumes:

DLT 2010Ed
DLT 2010Ed
CIAA 2004Ed
CIAA 2004Ed
CIAA 2000Ed
CIAA 2000Ed
WIA 1997Ed
WIA 1996Ed

Contributed to:

CIAA 20112011
DLT 20112011
DLT 20112012
LATA 20112011
CIAA 20102010
CIAA 20102011
CIAA 20092009
LATA 20092009
LATA 20082008
CIAA 20072007
LATA 20072007
CIAA 20062006
CIAA 20062007
DLT 20062006
CIAA 20022002
DLT 20012001
CIAA 20002000
CIAA 20002002
DLT 19991999
WIA 19991999
TOOLS USA 19981998
WIA 19981998
DLT 19971997
WIA 19971997
WIA 19961996
DLT 19951995
ICALP 19931993

Wrote 29 papers:

CIAA-2011-Yu
Derick Wood: Always in Our Hearts (SY), pp. 1–2.
DLT-2011-YuG #approximate #complexity #research
State Complexity Research and Approximation (SY, YG), pp. 46–57.
DLT-J-2011-GaoY12 #approximate #complexity
State Complexity and Approximation (YG, SY), pp. 1085–1098.
LATA-2011-SalomaaSY #complexity
Undecidability of the State Complexity of Composed Regular Operations (AS, KS, SY), pp. 489–498.
CIAA-2010-CuiGKY #complexity
State Complexity of Catenation Combined with Union and Intersection (BC, YG, LK, SY), pp. 95–104.
CIAA-J-2010-CuiGKY11 #complexity
State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection (BC, YG, LK, SY), pp. 1797–1812.
CIAA-2009-LuY #automaton #finite #question
Are Statecharts Finite Automata? (HL, SY), pp. 258–261.
LATA-2009-HanSY #complexity #regular expression
State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
LATA-2008-SalomaaSY
Length Codes, Products of Languages and Primality (AS, KS, SY), pp. 476–486.
CIAA-2007-SalomaaYZ
Deterministic Caterpillar Expressions (KS, SY, JZ), pp. 97–108.
LATA-2007-LiuMSY #complexity
State Complexity of Basic Operations Combined with Reversal (GL, CMV, AS, SY), pp. 355–366.
CIAA-2006-Yu #complexity #on the
On the State Complexity of Combined Operations (SY), pp. 11–22.
CIAA-J-2006-SalomaaY07 #complexity #estimation #on the
On the State Complexity of Combined Operations and their Estimation (KS, SY), pp. 683–698.
DLT-2006-SanteanY #ambiguity #finite #on the #transducer
On Weakly Ambiguous Finite Transducers (NS, SY), pp. 156–167.
CIAA-2002-CampeanuSY #regular expression
Regex and Extended Regex (CC, KS, SY), pp. 77–84.
DLT-2001-DomaratzkiSY #formal method
Minimal Covers of Formal Languages (MD, JS, SY), pp. 319–329.
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.
DLT-1999-SalomaaY #composition #finite #on the
On the decomposition of finite languages (AS, SY), pp. 22–31.
WIA-1999-CaludeSY #analysis #metric
Metric Lexical Analysis (CC, KS, SY), pp. 48–59.
WIA-1999-CampeanuCSY #complexity #finite
State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.
TOOLS-USA-1998-MaY #diagrams #reduction
Practical Rules for Reduction on the Number of States of a State Diagram (JM, SY), p. 46–?.
WIA-1998-CampeanuSY #finite
Minimal Cover-Automata for Finite Languages (CC, NS, SY), pp. 43–56.
WIA-1998-HuerterSWY #automaton #finite #implementation
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations (SH, KS, XW, SY), pp. 69–81.
DLT-1997-MateescuSY #context-free grammar #decidability
Decidability of fairness for context-free languages (AM, KS, SY), pp. 351–364.
WIA-1997-SalomaaWY #implementation #performance #regular expression #using
Efficient Implementation of Regular Languages Using R-AFA (KS, XW, SY), pp. 176–184.
WIA-1996-SalomaaY #automaton #finite #nondeterminism
NFA to DFA Transformation for Finite Languages (KS, SY), pp. 149–158.
DLT-1995-SalomaaY #context-free grammar #nondeterminism
Nondeterminism Degrees for Context-Free Languages (KS, SY), pp. 154–165.
ICALP-1993-JiangSSY #decidability #pattern matching
Inclusion is Undecidable for Pattern Languages (TJ, AS, KS, SY), pp. 301–312.
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.