I want to know what language is generated by this CFG
S → SS | bS | a
I have obtained some strings but cannot find a pattern
abbaaaa
aaaaaaa
ba
aaaaa
aaaaaaabaaaabbaa
babaaabaaaba
bbbababaababaa
baabaa
baa
aaaaaabbaaabbba
I want to know what language is generated by this CFG
S → SS | bS | a
I have obtained some strings but cannot find a pattern
abbaaaa
aaaaaaa
ba
aaaaa
aaaaaaabaaaabbaa
babaaabaaaba
bbbababaababaa
baabaa
baa
aaaaaabbaaabbba
Copyright © 2021 Jogjafile Inc.
Sis"a". Also last character generated bySis alsoa;bSmeans that if there isbin the string then after it there must be more characters (because the grammar does not generate epsilon). These characters could be moreb, but eventuallyamust follow (as noted up). That isntimes ofb, wheren >= 0;SSthe language allows repetitions (an infinite number of times (k)) of this zero or morebcharacters followed by onea.The language L should be this (where Sigma is the alphabet):
This could be written with regular expression like this: