# Question relating to NFA

Is there any NFA that can accept every alternate symbol in a given string.

Ex. if w = abab, the NFA should accept bb

• An NFA accepts a word $w$ if there is an accepting computation for $w$ (you might be using an equivalent definition, which could look rather different). The language accepted by an NFA consists of all words it accepts. – Yuval Filmus Sep 18 at 10:13
• What would it mean for an NFA to "accept every alternate symbol in a given string"? – Yuval Filmus Sep 18 at 10:13