Titlebook: STACS 98; 15th Annual Symposiu Michel Morvan,Christoph Meinel,Daniel Krob Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 199

显微镜

辩论的终结

anachronistic

A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and aution-find algorithms. The goal of this paper is to propose a single routine to quickly implement all these already known algorithms and to solve a large class of potentially new problems. Our framework yields to a unique scheme for correctness proofs and complexity analysis. Various examples are pres

STING

Simplifying the modal mu-calculus alternation hierarchy,llary of a deep and highly technical analysis of [Lub93]. In this paper, we show that the alternation hierarchy in arithmetic can be established by entirely elementary means; further, simple examples of strict alternation depth n formulae can be constructed, which in turn give very simple examples t

Cupping

On disguised double horn functions and extensions,ariables), we consider the class ... of disguised double Horn functions, i.e., the functions which and whose complement are both disguised Horn. We investigate the syntactical properties of this class and relationship to other classes of Boolean functions. Moreover, we address the extension problem

树木中

inhumane

不整齐

Blazon

CERE

Inducing an order on cellular automata by a grouping operation,. Based on this operation a preorder ≤ on the set of one dimensional CA is introduced. It is shown that (CA,≤) admits a global minimum and that on the bottom of (CA,≤) very natural equivalence classes are located. These classes remind us the first two well-known Wolfram ones because they capture glo