scientific article; zbMATH DE number 16574
[For the entire collection see Zbl 0702.00007.] The author considers some problems of the mathematical theory of tests, which was founded in 1958 by S. V. Yablonskij and I. A. Chegis. \dots A test table is a finite table, filled by natural numbers, in which the columns are pairwise distinct and the set of columns is divided into classes. A test of a test table is a set of rows on which any two columns of different classes of partitioning differ. A test is a deadlock test if no proper subset of it is a test. A finite table, filled by natural numbers, with pairwise different columns, is called an \(L\)-table if for any partitioning of the set of columns into classes, the test table obtained has a unique deadlock test. Necessary and sufficient uniqueness conditions are given for the deadlock test of a test table; and also necessary and sufficient and some sufficient conditions for a table to be an \(L\)-table.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973259)
