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 × Belgium
2 × Germany
3 × France
4 × Canada
5 × USA
Collaborated with:
A.Brüggemann-Klein Y.Han E.Soisalon-Soininen D.Giammarresi ∅ J.H.Johnson Y.Kwong K.Salomaa J.Ponty J.Albert O.Nurmi A.L.Rosenberg Z.Galil S.Hermann B.Chazelle T.Ottmann
Talks about:
automata (8) tree (6) regular (5) general (5) context (4) languag (3) express (3) extend (3) nondeterminist (2) algorithm (2)

Person: Derick Wood

DBLP DBLP: Wood:Derick

Facilitated 3 volumes:

CIAA 2001Ed
WIA 1997Ed
WIA 1996Ed

Contributed to:

LATA 20072007
DLT 20062006
CIAA 20052005
CIAA 20042004
CIAA 20042005
CIAA 20022002
CIAA 20002000
CIAA 20002002
DLT 19991999
WIA 19991999
WIA 19981998
WIA 19971997
WIA 19961996
PODS 19871987
ICALP 19841984
PODS 19821982
SIGMOD 19801980
STOC 19791979
ADL 19991999

Wrote 19 papers:

LATA-2007-HanW #regular expression
Generalizations of One-Deterministic Regular Languages (YSH, DW), pp. 273–284.
DLT-2006-HanSW #regular expression
Prime Decompositions of Regular Languages (YSH, KS, DW), pp. 145–155.
CIAA-2005-HanW #automaton #finite #regular expression
Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
CIAA-2004-HanW #automaton
The Generalization of Generalized Automata: Expression Automata (YSH, DW), pp. 156–166.
CIAA-J-2004-HanW05 #automaton
The generalization of generalized automata: expression automata (YSH, DW), pp. 499–510.
CIAA-2002-Bruggemann-KleinW #context-free grammar #on the #parsing #predict
On Predictive Parsing and Extended Context-Free Grammars (ABK, DW), pp. 239–247.
CIAA-2000-Bruggemann-KleinW #automaton #nondeterminism
Regularly Extended Two-Way Nondeterministic Tree Automata (ABK, DW), pp. 57–66.
CIAA-J-2000-Bruggemann-KleinW02 #automaton #nondeterminism
The Regularity of Two-Way Nondeterministic Tree Automata Languages (ABK, DW), pp. 67–81.
DLT-1999-Bruggemann-KleinW #automaton #pattern matching
Caterpillars, context, tree automata and tree pattern matching (ABK, DW), pp. 270–285.
WIA-1999-GiammarresiPW #graph
Thompson Digraphs: A Characterization (DG, JLP, DW), pp. 91–100.
WIA-1998-AlbertGW #algorithm #context-free grammar #normalisation
Extended Context-Free Grammars and Normal Form Algorithms (JA, DG, DW), pp. 1–12.
WIA-1997-Wood #theory and practice
WIA and Theory and Practice (DW), pp. 1–6.
WIA-1996-JohnsonW #set
Instruction Computation in Subset Construction (JHJ, DW), pp. 64–71.
PODS-1987-NurmiSW #concurrent #database
Concurrency Control in Database Structures with Relaxed Balance (ON, ESS, DW), pp. 170–176.
ICALP-1984-ChazelleOSW #complexity #decidability
The Complexity and Decidability of Separation (BC, TO, ESS, DW), pp. 119–127.
PODS-1982-Soisalon-SoininenW #algorithm #detection #safety #testing #transaction
An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems (ESS, DW), pp. 108–116.
SIGMOD-1980-KwongW #concurrent #on the
On B-Trees: Routing Schemes and Concurrency (YSK, DW), pp. 207–211.
STOC-1979-RosenbergWG #data type
Storage Representations for Tree-Like Data Structures (ALR, DW, ZG), pp. 99–107.
ADL-1999-Bruggemann-KleinHW #specification #visual notation
The Visual Specification of Context (ABK, SH, DW), pp. 28–36.
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.