Consider the language S*, where S = {a ab ba}.
A. Is the string (a bb ba) a wordin this language?
B. Write out all the words in this language with 3 letters.
C. Write 5 words from this language with 4 letters.
D. What is another way in which to describe the words in this language?

Check Explanation

Explanation:

A) the string (abbba) is not a word in this language because in this language, each b must preceded or followed by an a. Three consecutive b's are just not possible.

B) All the words with 3 letters in this language

aaa

aab

aba

baa

C) 5 words with four letters from this language. I'll write as many as possible to make things as easy as possible.

aaab

aaba

baab

baba

baaa

abaa

abab

abba

D) This is the language of words without bbb, with every bb preceded and followed by an a (that is, no word can start or end wilth bb). All non-empty strings contain at least one a (so b and bb together are not allowed!).

Hope this Helps!!!

hmu if ur willing to do a algebra a online class i’ll pay 600 hmu on the gram profitpreme

b. related objects

explanation:

data is stored in related objects in an access database.