The following pages link to Derick Wood (Q596098):
Displayed 50 items.
- (Q236671) (redirect page) (← links)
- On the state complexity of reversals of regular languages (Q596099) (← links)
- Structural equivalence and ET0L grammars (Q671426) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Speed-varying OL systems (Q754656) (← links)
- L codes and number systems (Q788495) (← links)
- The contour problem for rectilinear polygons (Q802313) (← links)
- On the definition and computation of rectilinear convex hulls (Q802314) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- A tight upper bound for the path length of AVL trees (Q912600) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- Grammar and L forms: an introduction (Q1055198) (← links)
- Synchronized EOL forms (Q1056549) (← links)
- Context-free grammar forms with strict interpretations (Q1056550) (← links)
- Purely top-down updating algorithms for stratified search trees (Q1057067) (← links)
- An inverse homomorphic characterization of full principal AFL (Q1058861) (← links)
- Erratum to: ``A three-restricted normal form theorem for ETOL languages (Q1061489) (← links)
- Inverse morphic equivalence on languages (Q1061490) (← links)
- A note on the largest empty rectangle problem (Q1096397) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- The node visit cost of brother trees (Q1098304) (← links)
- The orthogonal convex skull problem (Q1102544) (← links)
- Time-and space-optimal contour computation for a set of rectangles (Q1108000) (← links)
- Optimum multiway search trees (Q1138383) (← links)
- An approach to a unified theory of grammar and L forms (Q1140995) (← links)
- Context-free grammars with selective rewriting (Q1145511) (← links)
- On generators and generative capacity of EOL forms (Q1146007) (← links)
- Space and time optimal algorithms for a class of rectangle intersection problems (Q1148121) (← links)
- Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees (Q1148683) (← links)
- Colorings and interpretations: a connection between graphs and grammar forms (Q1155066) (← links)
- Sub-regular grammar forms (Q1160490) (← links)
- Completeness of context-free grammar forms (Q1160491) (← links)
- On a covering relation for context-free grammars (Q1161309) (← links)
- Decidability and density in two-symbol grammar forms (Q1162822) (← links)
- A three-restricted normal form theorem for ETOL languages (Q1163380) (← links)
- Stabbing line segments (Q1163869) (← links)
- A note on some tree similarity measures (Q1166933) (← links)
- The parenthesis tree (Q1171389) (← links)
- Restricted-oriented convex sets (Q1174335) (← links)
- Bounded delay L codes (Q1178694) (← links)
- Defining families of trees with E0L grammars (Q1179185) (← links)
- A note on the path length of red-black trees (Q1198079) (← links)
- Right invariant metrics and measures of presortedness (Q1209145) (← links)
- On grammar forms with terminal context (Q1219689) (← links)
- Time-delayed OL languages and sequences (Q1222023) (← links)
- A note on K-iteration grammars (Q1223940) (← links)
- A decomposition theorem for hyper-algebraic extensions of language families (Q1225945) (← links)
- EOL forms (Q1234593) (← links)
- Generalized time-delayed OL languages (Q1236891) (← links)