36 search results - page 1 / 8 » Decidable Approximations of Sets of Descendants and Sets of ... |
RTA
1998
Springer
13 years 8 months ago
1998
Springer
IAT
2008
IEEE
13 years 11 months ago
2008
IEEE
Auctions are pervasive in today’s society and provide a variety of real markets. This article facilitates a strategic choice between a set of available trading strategies by int...
RTA
2010
Springer
13 years 7 months ago
2010
Springer
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 ...
AUTOMATICA
2004
13 years 5 months ago
2004
In this paper, the problem of non-regular static state feedback linearization of a ne nonlinear systems is considered. First of all, a new canonical form for non-regular feedback ...
PARLE
1987
13 years 8 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...