Tessellate S.T.E.M.S. (2019) - Computer Science - College - Set 4 - Objective Problem 2

Computer Science Level pending

L L is a language over { a , b } \{a,b\}^* where the number of substring a b ab and b a ba occurring in it are the same.

For instance a word w w is a substring of u u , if for some u 1 u_1 and u 2 u_2 in { a , b } \{a,b\}^* , u = u 1 w u 2 u = u_1 \cdot w \cdot u_2 .

So, which of the following is true about w w ?

  • A) w is Regular
  • B) w is a CFL, not regular
  • C) w is decidable but not a CFL
  • D) w is decidable but not known to be in NP

This problem is a part of Tessellate S.T.E.M.S (2019)

D A B C

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...