Abstract:
We prove that, for each natural $k$, any Boolean function can be implemented by a two-pole contact circuit which is $k$-irredundant and admits a $k$-diagnostic test of length at most $1$ relative to similar-type connected faults of contacts in groups, where each group consists of one closing and one breaking contact.