228 search results - page 21 / 46 » Two Normal Forms for Rewriting P Systems |
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Due to the nature of an acoustic enclosure, the early part (i.e., direct path and early reflections) of the acoustic echo path is often sparse while the late reverberant part of ...
LCPC
1992
Springer
13 years 11 months ago
1992
Springer
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
This paper describes a new method to recover the sign of the local Gaussian curvature at each point on the visible surface of a 3-D object. Multiple (p > 3) shaded images are a...