A language L consists of the words {01, 111, 1001, 0011}. The language L ∗ is formed by all possible concatenations of the words in the language L. Which one of the following words belongs to the language L ∗?
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
A language L consists of the words {01, 111, 1001, 0011}. The language L ∗ is formed by all possible concatenations of the words in the language L. Which one of the following words belongs to the language L ∗?
Name |
---|
I guess you forgot to give the "following words" :)
you need to try concatenations all possible words from L
that means you need to Generating all possible Subsequences
read this blog to know how to do that https://www.geeksforgeeks.org/generating-all-possible-subsequences-using-recursion/
after that check the following words **[I think it's from input as I guess] if it included on it.
to it's look like this
Thank you a lot
you're welcome