228 search results - page 4 / 46 » Two Normal Forms for Rewriting P Systems |
NAACL
2010
13 years 5 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
RTA
2005
Springer
14 years 25 days ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
IPL
2007
13 years 7 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
VIROLOGY
2008
13 years 7 months ago
2008
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
CASC
2007
Springer
13 years 11 months ago
2007
Springer
We find a full system of invariants with respect to gauge transformations L g-1 Lg for third-order hyperbolic linear partial differential operators on the plane. The operators are...