![isabelsmhl](/avatars/27868.jpg)
isabelsmhl
11.02.2020 •
Computers and Technology
Let Σ= {a, b}.
a. Consider the language S*, where S= {aa ab ba bb}. Give another description of this language.
b. Give an example of a set S such that S* only contains all possible strings of a’s and b’s that have length divisible by 3.
Solved
Show answers
More tips
- S Sport When will the Biathlon World Championships 2011 take place in Khanty-Mansiysk? Answers to frequently asked questions...
- O Other What is a Disk Emulsifier and How Does it Work?...
- F Family and Home What does a newborn need?...
- F Family and Home Choosing the Right Car Seat for Your Child: Tips and Recommendations...
- F Food and Cooking How to Get Reconfirmation of Registration?...
- C Computers and Internet How to Get Rid of Spam in ICQ?...
- A Art and Culture Who Said The Less We Love a Woman, the More She Likes Us ?...
- F Family and Home How to Get Rid of Your Neighbors?...
- S Society and Politics How Could Nobody Know About the Dead Mountaineers?...
- H Health and Medicine How to Cure Adenoids?...
Answers on questions: Computers and Technology
- B Business Aubosh, a car manufacturing company, is in a contract with Bolivin Tires. Under this contract, Aubosh purchases tires from Bolivin Tires for all its mid-range cars. In this scenario,...
- M Mathematics Michael is collecting data for the growth of plants after one week He planted nine seeds for each of three different types of plants and recorded his data in the table below....
- S Social Studies What is the identity of the smoke released when a candle is extinguished?...
- E English Read the sentence. the children, who were lucky, got presents. which statements accurately describe the sentence? select two options. the sentence contains a restrictive clause. the...
- H History Congress should organize a national army true or false...
Ответ:
a.
S = {aa ab ba bb}
This clearly shows that that every string that belongs to this language has an even length including 0 length.
This language can be depicted as following
S* = {∧ aa ab ba bb aaab aaba aabb bbaa . . .}
Regular Expression for this can be
RE = (aa+ab+ba+bb)*
So S* contains all the strings of a's and b's that have even length. This means all strings of even length.
Explanation:
b.
S* contains all possible strings of a's and b's that have length divisible by 3
This means some of the possible strings examples are:
aaa, bbb, aaabbb, , and so on.
Length divisible by 3 means the length of string such as aaa is 3 which is divisible by 3, also has length 6 which is divisible by 3
This should be something like this:
(( a + b ) ^3)*
For example a^3 = aaa which is divisible by 3
Regular expression can be:
RE of S* = (aaa + bbb)*
For example string has length 9 which is divisible by 3
So the language is
S* = { ∧ aaa bbb aaabbb bbb...}
Ответ:
Wi-Fi Protected Access 2 (WPA2)
Explanation:
The Wi-Fi Protected Access 2 (WPA2) makes some alterations to the encryption algorithm that were used in WPA and WEP to what is known as the Advanced Encryption Standard (AES). This is a 128-bit block cipher considered to be much more difficult to crack than the usual 128-bit TKIP wrapper. However, although WPA2 offers a much more tougher encryption standard, it is important to note that it is not hack proof.