Titlebook: Automata, Languages and Programming; 25th International C Kim G. Larsen,Sven Skyum,Glynn Winskel Conference proceedings 1998 Springer-Verla

Flatter

thalamus

MORPH

Independent sets with domination constraints,ning vertices (. υ ? .: |. ∩ .| ? ..) For all values of ., we classify as either .-complete or polynomial-time solvable the problems of deciding if a given graph has a .-independent set. We complement this with approximation algorithms and inapproximability results, for all the corresponding optimiz

事物的方面

表否定

Deciding bisimulation-like equivalences with finite-state processes, this method to the class of PAD processes, which strictly subsumes PA and push-down (PDA) processes, showing that a large class of bisimulation-like equivalences (including e.g. strong and weak bisimilarity) is decidable between PAD and finite-state processes. On the other hand, we also demonstrate

Campaign

自傳

Deciding global partial-order properties,so sharpen previous undecidability results, which used global predicates over configurations. We show that although our logic allows only local propositions (over events), it becomes undecidable when adding some natural . operator.

cocoon

Simple linear-time algorithms for minimal fixed points,point evaluation in dependency graphs. This establishes dependency graphs as a suitable framework in which to express and compute alternation-free fixed points..Finally, we relate HORNSAT, the problem of Horn formula satisfiability, to the problem of minimal fixed-point evaluation in dependency grap

Mhc-Molecule

On the expressiveness of real and integer arithmetic automata,at tests the value of a specified digit of a number. Furthermore, in the course of proving that sets of vectors defined in this theory are recognizable by finite automata, we show that linear equations and inequations have surprisingly compact representations by automata, which leads us to believe t

無政府主義者