Co-recursively enumerable language
= Co-recursively enumerable language
A <formal language> whose <complement of a set>, relative to the <set> of all input <words>, is a <recursively enumerable language>. A recognizer for the complement detects every negative instance eventually and need not halt on positive instances. A <formal language> is a <decidable language> exactly when it and its complement are both <recursively enumerable languages>.