We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries ...
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
We present a brief observational, ‘ethnographic’, study of the Roughing Mill in a steel plant and use material from recorded activities to provide ‘illustrative vignettes’ ...
Karen Clarke, John A. Hughes, David Martin, Mark R...