1000 search results - page 37 / 200 » Nominal rewriting systems |
FUIN
2006
14 years 11 months ago
2006
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
FUIN
2002
14 years 11 months ago
2002
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
ICALP
1990
Springer
15 years 3 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
121
click to vote
PVLDB
2010
14 years 10 months ago
2010
Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms a...
ENTCS
2007
14 years 11 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...