85 search results - page 3 / 17 » Decidability of Trajectory-Based Equations |
PARLE
1987
13 years 9 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...
JC
2000
13 years 5 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
RTA
1998
Springer
13 years 9 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
CSL
2005
Springer
13 years 11 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
ISIPTA
2003
IEEE
13 years 10 months ago
2003
IEEE
The nature of much information available to decision makers is vague and imprecise, be it information for human managers in organisations or for process agents in a distributed co...