Your Name CS 4301 Lab 11 {(x=, x=ans) | x is in {a, b, c}* and ans = 1 if x has a substring of length three containing each of the symbols exactly once ans = 0 otherwise} Input: = Output: =0 Input: a= Output: a=0 Input: b= Output: b=0 Input: c= Output: c=0 Input: aa= Output: aa=0 Input: ab= Output: ab=0 Input: ba= Output: ba=0 Input: ac= Output: ac=0 Input: ca= Output: ca=0 Input: aaa= Output: aaa=0 Input: aab= Output: aab=0 Input: aba= Output: aba=0 Input: baa= Output: baa=0 Input: abc= Output: abc=1 Input: acb= Output: acb=1 Input: bac= Output: bac=1 Input: bca= Output: bca=1 Input: cab= Output: cab=1 Input: cba= Output: cba=1 Input: bbaa= Output: bbaa=0 Input: aabc= Output: aabc=1 Input: aacb= Output: aacb=1 Input: abac= Output: abac=1 Input: abca= Output: abca=1 Input: acab= Output: acab=1 Input: acba= Output: acba=1 Input: baac= Output: baac=0 Input: cccab= Output: cccab=1 Input: cccba= Output: cccba=1 Input: acccc= Output: acccc=0 Input: caccc= Output: caccc=0 Input: ccacc= Output: ccacc=0 Input: ccccab= Output: ccccab=1 Input: ccccba= Output: ccccba=1 Input: accccc= Output: accccc=0 Input: cacccc= Output: cacccc=0 Input: ccbaccc= Output: ccbaccc=1 Input: ccbcacc= Output: ccbcacc=1 Input: ccbccac= Output: ccbccac=0 Input: ccbccca= Output: ccbccca=0 Input: cccabcc= Output: cccabcc=1 Input: cccacbc= Output: cccacbc=1 Input: cccaccb= Output: cccaccb=0 Input: cccbacc= Output: cccbacc=1 Input: cccbcac= Output: cccbcac=1 Input: baabaaaaaaaaa= Output: baabaaaaaaaaa=0 Input: babaaaaaaaaaa= Output: babaaaaaaaaaa=0 Input: bbaaaaaaaaaaa= Output: bbaaaaaaaaaaa=0 Input: aaaaaaaaaaabc= Output: aaaaaaaaaaabc=1 Input: aaaaaaaaaaacb= Output: aaaaaaaaaaacb=1 Input: aaaaaaaaaabac= Output: aaaaaaaaaabac=1 Input: aaaaaaaaaabca= Output: aaaaaaaaaabca=1