Sciweavers

228 search results - page 2 / 46
» Two Normal Forms for Rewriting P Systems
Sort
View
RTA
2010
Springer
13 years 7 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
POPL
1997
ACM
13 years 9 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
LICS
1990
IEEE
13 years 9 months ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter
IJBC
2008
85views more  IJBC 2008»
13 years 5 months ago
Center bifurcation for Two-Dimensional Border-Collision Normal Form
In this work we study some properties associated with the bordercollision bifurcations in a two-dimensional piecewise linear map in canonical form, related to the case in which a ...
Iryna Sushko, Laura Gardini