Titlebook: Computer Science Logic; 10th International W Dirk Dalen,Marc Bezem Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 1997 Compu

Hallmark

MULTI

Kleene algebra with tests: Completeness and decidability,h tests and-continuous Kleene algebra with tests over language-theoretic and relational models. We also show decidability. Cohen‘s reduction of Kleene algebra with hypotheses of the form .=0 to Kleene algebra without hypotheses is simplified and extended to handle Kleene algebras with tests.

不感兴趣

Optimization problems with approximation schemes, more general definability theory of optimization problems. We define a class . φ and show that every problem in this class has a . (FPTAS), i.e., can be approximated to every desired accuracy . in time polynomial in the size of the input and 1/.. An example for a problem in . φ is ..