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 × Canada
1 × Croatia
1 × Finland
1 × Germany
1 × Greece
1 × Hungary
1 × Japan
1 × New Zealand
1 × Switzerland
2 × Denmark
2 × Spain
Collaborated with:
S.Jain B.Borchert B.Khoussainov S.Rubin Z.Gao A.Nies H.Fernau J.Case K.Lange P.Tesson D.Thérien A.Miasnikov Q.Luo D.Kuske C.S.Calude L.Staiger E.Martin P.M.Nguyen A.Sharma G.Baliga W.Merkle T.D.Le Y.S.Ong P.Semukhin L.Fortnow R.Freivalds W.I.Gasarch M.Kummer S.A.Kurtz C.H.Smith
Talks about:
automat (4) languag (3) learn (3) correspond (2) hierarchi (2) polynomi (2) learnabl (2) order (2) level (2) depth (2)

Person: Frank Stephan

DBLP DBLP: Stephan:Frank

Contributed to:

LATA 20122012
LICS 20122012
LATA 20112011
LATA 20102010
DLT 20082008
DLT 20042004
DLT 20042005
LICS 20042004
LICS 20032003
ICLP 20022002
ICALP 20002000
ICALP 19981998
DLT 19971997
ICALP 19951995

Wrote 14 papers:

LATA-2012-GaoS
Learnability of Co-r.e. Classes (ZG, FS), pp. 252–263.
LICS-2012-JainMS #complexity
The Complexity of Verbal Languages over Groups (SJ, AM, FS), pp. 405–414.
LATA-2011-CaseJLOSS #automation #learning #pattern matching #subclass
Automatic Learning of Subclasses of Pattern Languages (JC, SJ, TDL, YSO, PS, FS), pp. 192–203.
LATA-2010-JainLS #automation
Learnability of Automatic Classes (SJ, QL, FS), pp. 321–332.
DLT-2008-CaludeNSS #recursion #set #string
Universal Recursively Enumerable Sets of Strings (CSC, AN, LS, FS), pp. 170–182.
DLT-2004-BorchertLSTT #polynomial
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels (BB, KJL, FS, PT, DT), pp. 89–101.
DLT-J-2004-BorchertLSTT05 #polynomial
The dot-depth and the polynomial hierarchies correspond on the delta levels (BB, KJL, FS, PT, DT), pp. 625–644.
LICS-2004-KhoussainovNRS #automation
Automatic Structures: Richness and Limitations (BK, AN, SR, FS), pp. 44–53.
LICS-2003-KhoussainovRS #automation #on the #partial order
On Automatic Partial Orders (BK, SR, FS), pp. 168–177.
ICLP-2002-MartinNSS #learning #logic #prolog
Learning in Logic with RichProlog (EM, PMN, AS, FS), pp. 239–254.
ICALP-2000-BaligaCMS
Unlearning Helps (GB, JC, WM, FS), pp. 844–855.
ICALP-1998-BorchertKS #first-order #on the
On Existentially First-Order Definable Languages and Their Relation to NP (BB, DK, FS), pp. 17–28.
DLT-1997-FernauS #how
How Powerful is Unconditional Transfer? — When UT meets AC (HF, FS), pp. 249–260.
ICALP-1995-FortnowFGKKSS #learning
Measure, Category and Learning Theory (LF, RF, WIG, MK, SAK, CHS, FS), pp. 558–569.
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.