-3
$\begingroup$

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

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

$\endgroup$
  • $\begingroup$ 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. $\endgroup$ – Yuval Filmus Sep 18 at 10:13
  • 1
    $\begingroup$ What would it mean for an NFA to "accept every alternate symbol in a given string"? $\endgroup$ – Yuval Filmus Sep 18 at 10:13

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.