Answer:
See explaination
Explanation:
Kleene's Theorem states that, in fact, these classes are the same: every regular language may be recognized by some FA, and every FA language may be represented using a regular expression.
Kindly check attachment for the step by step solution of the given problem.
Answer:
United States Department of Homeland Security
The National Cyber Security Division (NCSD) is a division of the Office of Cyber Security & Communications, within the United States Department of Homeland Security's Cybersecurity and Infrastructure Security Agency.
<em>Give</em><em> </em><em>me</em><em> </em><em>brainliest</em><em> </em>
PC's and LAN spreaders* or internet network extenders.
*if the school uses a LAN network.
Answer:
// code in C++.
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variables
int n;
cout<<"Enter a positive number:";
// read number
cin>>n;
// check number is positive or not
while(n<0)
{
// if number is negative
cout<<"Wrong input!!"<<endl;
// ask again to enter again
cout<<"Enter again:";
// read number again
cin>>n;
}
// generate random number between 1 to n
int ran=rand()%n +1;
// print random number
cout<<"Random number between 1 to "<<n<<" is: "<<ran<<endl;
return 0;
}
Explanation:
Read a number from user.Then if input number is negative then ask user to enter a positive number again.After this generate a random number between 1 to n.Print that random number.
Output:
Enter a positive number:-12
Wrong input!!
Enter again:9
Random number between 1 to 9 is: 2
