3. Let S={ab, bb} and T={ab, bb, bbb}. Show that S*≠T* but that S*⊂T*. 4. Write the regular expression for the language of all strings, over alphabet {a, b}, that end in a double letter, i.e. ending in aa or bb but not ab or ba
Subject -
Please do no. 3 & no 4 and make sure you write the no for wich one you provided answer. Thanks in advance
3. Let S={ab, bb} and T={ab, bb, bbb}. Show that S*≠T* but that S*⊂T*.
4. Write the regular expression for the language of all strings, over alphabet {a, b}, that end in a double letter, i.e. ending in aa or bb but not ab or ba
5. Draw Deterministic Finite Automata to accept the following sets of strings, over the alphabet {0,1}, that contain exactly four 0s (not necessarily consecutive zeros)
6. Write the regular expression for the language of all strings, over alphabe that end t {0, 1}, the set of all strings in which every pair of adjacent zeros appears before any pair of adjacent ones. Justify
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
