4074 search results - page 684 / 815 » Abstract Graph Transformation |
129
click to vote
DLT
2006
15 years 3 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
117
click to vote
STRINGOLOGY
2004
15 years 3 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
134
click to vote
INTERACT
2003
15 years 3 months ago
2003
: Whereas sophisticated computer users can exercise more control in what they are exposed to and produce computational artifacts, technologically challenged end-users assume a more...
134
click to vote
ISMB
1993
15 years 3 months ago
1993
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
109
Voted
SLP
1993
15 years 3 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...