228 search results - page 1 / 46 » Two Normal Forms for Rewriting P Systems |
MCU
2001
13 years 6 months ago
2001
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
MFCS
1997
Springer
13 years 9 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
CTRS
1992
13 years 9 months ago
1992
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
MFCS
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...