16.
B)[a,aaa ],[ aab,b],[abaa,ab]
i | xi | yi |
1 | a | aaa |
2 | aab | b |
3 | abaa | ab |
here i am denoting the post correspondence with instance
x1x2x3x1 = y1y2y3y1
aaababaaa = aaababaaa
hence it is a post correspondence system.
D)[a,ab],[ba,aba],[b,aba],[bba,b]
i | xi | yi |
1 | a | ab |
2 | ba | aba |
3 | ba | aba |
4 | bba | b |
x1x2x3x1x4x3=y1y2y1y4y3
ababaabbaba=ababaabbaba
hence it is a post correspondence system.
17)
B)[ab,a],[ba,bab],[b,aa],[ba,ab]
i | xi | yi |
1 | ab | a |
2 | ba | bab |
3 | b | aa |
4 | ba | ab |
x1x2x1x3x4 not equal y1y3y1y4y2y1
hence both terms are not equal. here y terms are not matching the x terms in the left side so.both are not equal
It is not a Post correspondence system.
D)[ab,bb],[aa,ba],[ab,abb],[bb,bab]
i | xi | yi |
1 | ab | bb |
2 | aa | ba |
3 | ab | bbb |
4 | bb | bab |
x1x2not equal because we cannot match the X2 in the y columns. so we cannot match them.
Hence it is not a post correspondence problem.
lIhg derivation in tion for each of the following Post correspondence systems. 16, Find a solution...
please answer 17c and 17d. 17. Show that the following Post correspondence systems have no solutions. a) [b, ba], [aa, b], [bab, aa], [ab, ba] b) [ab, a]. [ba, bab], [b, aa], [ba, ab] c)lab, aba] lbaa, aa]. [aba. baal (dy [ab, bb], [aa, ba]. [ab, abb]. [bb, bab] e) [abb, ab], [aba, ba], [aab, abab] 17. Show that the following Post correspondence systems have no solutions. a) [b, ba], [aa, b], [bab, aa], [ab, ba] b) [ab, a]. [ba,...
• Build an FA that accepts the language of all words with only a’s or only b’s in them. For example, a, aa, aaa, b, bb, bbb, etc are in the language, while null string, ab, ba, aab, aba, bab, bba, baa, etc are not in the language. • Give a regular expression for this language.