228 search results - page 5 / 46 » Two Normal Forms for Rewriting P Systems |
CADE
2004
Springer
14 years 7 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
TWC
2008
13 years 7 months ago
2008
In this paper, the statistics of quadratic forms in normal random variables (RVs) are studied and their impact on performance analysis of wireless communication systems is explored...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
IFIP
2004
Springer
14 years 22 days ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
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...