The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constr...

Complementation between temperature-sensitive (ts) variants of Balb/c-3T3 defective in the G1 phase of its cell cycle was measured in the [3H]thymidine-labeling indices of the multinucleated cells during incubation at the restricted temperature (38 degrees C) following cell fusion. One ts variant from each group along the length of the G1 phase was tested for complementation. Varying degrees of...

Ethyl methanesulphonate (EMS) was used to induce 39 lethal and 13 karmoisin mutations within Df(3R)kar(3J), a nine-band deficiency extending from 87C1 to 87C9 (inclusive). Five complementation groups (four lethal and one visible) were identified and cytologically mapped between 87C4-5 and 87C9, one complementation group per band, with the exception of complementation group A, which is localized...

Eighteen complementation groups were identified by complementation tests and by phenotype from twenty temperature-sensitive mutants isolated independently in Glasgow, Scotland, and Houston, Tex.

Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-negative integers k and t with k ≤ t such that two h-uniform hypergraphs H and H′ on the same set V of vertices, with ∣V ∣ ≥ t, are equal up to complementation whenever H and H′ are k-hypomorphic up to complementation. Let s(h) be the least integer k such that the conclusion above holds and let v...

Complementation of Büchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation. The first is the rank-based approach of Kupferman and Vardi, which operates over a dag that embodies all runs of the automaton. This approach is based on the observation that the vertices of th...

Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This coalgebraic perspective on automata lays foundation to a universal theory of automata operating on infinite models of computation. In this paper we prove a complementation lemma for coalgebra automata. More specifically, we pro...