Answer:
Explanation:
If L(D1) = L(D2), the D has every state being final
If L(D1) = L¯(D2), the D has every state being final
If L(D1) = ∅, then L(D) = L(D2).
If L(D1)=Σ, L(D) = L(D2)
False. You should have little text and lots of pictures, because you are the one who should be doing the explaining, not the presentation.
// Variable to keep track of array size
int length = 0;
// Array itself
int array[] = {};
// while loop will take input in the array until a negative number is entered
while(input>=0){
stdin = new Scanner(System.in);
array[length] = stdin;
length +=1;
}
// int variable to terminate while loop
int i =0;
// keep track of index of output array
int y =0;
while(arr[i] != length){
// making output array
int output[]={}; bool flag;
// put the element in out put array considering if it the desired one
output[y] = array [i];
// Now check if it was the desired?
for(int z=1;z<=length;z++){
if(array[i+z]!=output[y]){
flag = true;
}
else
{
output[y]=0;
y+=1;
}
if(array[i+z+1]=output[y] && flag == true){
output[y] = array[i];
y+=1;
}
}
//output the array
for(int o=0;o<y;o++)
System.out.println(output[o];
Answer:
We will use script in oracle and SQl(Structured Query Language) and use of algorithms like cipher for encryption to insert a new flight into the flights table for the flight number 165 and that Cipher will show the desired message.