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 ∗?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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 ∗?
Название |
---|
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