1000 search results - page 14 / 200 » Nominal rewriting systems |
INFORMATICALT
2006
13 years 7 months ago
2006
Abstract. Robust stability results for nominally linear hybrid systems are obtained from total stability theorems for purely continuous-time and discrete-time systems. The class of...
ENTCS
2008
13 years 7 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
AAECC
2008
Springer
13 years 7 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...