☰

Derick Wood - Publications

Affiliations: 
Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

14 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2011 Wood D. An initial reconstruction of the Proto-Boro-Garo noun phrase North East Indian Linguistics. 3: 46-60. DOI: 10.1017/UPO9788175968875.006  0.31
2009 Han YS, Salomaa K, Wood D. Nondeterministic state complexity of basic operations for prefix-free regular languages Fundamenta Informaticae. 90: 93-106. DOI: 10.3233/Fi-2009-0008  0.551
2007 Han Y, Wang Y, Wood D. Prefix-free regular languages and pattern matching Theoretical Computer Science. 389: 307-317. DOI: 10.1016/J.Tcs.2007.10.017  0.573
2007 Han YS, Salomaa A, Salomaa K, Wood D, Yu S. On the existence of prime decompositions Theoretical Computer Science. 376: 60-69. DOI: 10.1016/J.Tcs.2007.01.013  0.561
2007 Han Y, Wood D. Obtaining shorter regular expressions from finite-state automata Theoretical Computer Science. 370: 110-120. DOI: 10.1016/J.Tcs.2006.09.025  0.528
2006 Han Y, Wang Y, Wood D. Infix-free regular expressions and languages International Journal of Foundations of Computer Science. 17: 379-393. DOI: 10.1142/S0129054106003887  0.593
2005 Han Y, Wood D. The Generalization Of Generalized Automata: Expression Automata International Journal of Foundations of Computer Science. 16: 499-510. DOI: 10.1142/S0129054105003121  0.524
2002 Brüggemann-Klein A, Wood D. The Regularity of two-way nondeterministic tree automata languages International Journal of Foundations of Computer Science. 13: 67-81. DOI: 10.1142/S0129054102000959  0.404
2001 Albert J, Giammarresi D, Wood D. Normal form algorithms for extended context-free grammars Theoretical Computer Science. 267: 35-47. DOI: 10.1016/S0304-3975(00)00294-2  0.356
2001 Kilpeläinen P, Wood D. SGML and XML Document Grammars and Exceptions Information & Computation. 169: 230-251. DOI: 10.1006/Inco.2000.2964  0.437
1998 Brüggemann-Klein A, Hermann S, Wood D. Context and Caterpillars and Structured Documents Lecture Notes in Computer Science. 1-9. DOI: 10.1007/3-540-49654-8_1  0.352
1998 Brüggemann-Klein A, Wood D. One-unambiguous regular languages Information & Computation. 142: 182-206. DOI: 10.1006/Inco.1997.2695  0.486
1997 Brüggemann-Klein A, Wood D. The validation of SGML content models Mathematical and Computer Modelling. 25: 73-84. DOI: 10.1016/S0895-7177(97)00025-3  0.443
1977 Wood D. Generalized time-delayed OL languages Information Sciences. 12: 151-155. DOI: 10.1016/0020-0255(77)90018-4  0.306
Show low-probability matches.