(sigma)={ a , b }, the length of the strings in language L is at least two, the first two symbols are combined with the last two is the same. For example; aa, bbb, aaaa, bbabb, ababab, … Draw the diagram of the DFA of language L.

(Emirp) An emirp (prime spelled backward) is a nonpalindromic prime number whose reversal is also a prime. For example, 17 is a prime and 71 is a prime, so 17 and 71 are both emirps. Write a Java program that displays the first 100 emirps. Display 10 numbers per line with a spacing of 5; all numbers should be left-aligned.

Please do in c++ only. Correct answer only else downvoted.     arrangement of round and square sections is given. You can change the arrangement by playing out the accompanying activities: shift the bearing of a section from opening to shutting as well as the other way around without changing the type of the section: for example you can change '(' to ')' and ')' to '('; you can change '[' to ']' and ']' to '['. The activity costs 0 burles.  change any square section to adjust section having a similar bearing: for example you can change '[' to '(' however not from '(' to '['; likewise, you can change ']' to ')' yet not from ')' to ']'. The activity costs 1 burle. The tasks can be acted in any request quite a few times. You are given a string s of the length n and q questions of the sort "l r" where 1≤l<r≤n. For each substring s[l… r], track down the base expense to pay to make it a right section grouping. It is ensured that the substring s[l… r] has an even length.  The inquiries…

( MindTap - Cenage )Example 5-6 implements the Number Guessing Game program. If the guessed number is not correct, the program outputs a message indicating whether the guess is low or high. Modify the program as follows: Suppose that the variables num and guess are as declared in Example 5-6 and diff is an int variable. Let diff = the absolute value of (num - guess). If diff is 0, then guess is correct and the program outputs a message indicating that the user guessed the correct number. Suppose diff is not 0. Then the program outputs the message as follows: If diff is greater than or equal to 50, the program outputs the message indicating that the guess is very high (if guess is greater than num) or very low (if guess is less than num). If diff is greater than or equal to 30 and less than 50, the program outputs the message indicating that the guess is high (if guess is greater than num) or low (if guess is less than num). If diff is greater than or equal to 15 and less than 30, the…

Explain More on Expressions in while Statements.

(Please do not give solution in image format thanku) Using the evaluation semantics of SML, rewrite the following expression into its simplest form. If the expression is syntactically illegal or its evaluation results in an error, then simply write "error" as the result. (fn f => (fn y => f y))(fn x => 1 + 1)

(Algebra: solve 2 * 2 linear equations) A linear equation can be solved using Cramer’s rule given in Programming Exercise 1.13. Write a program that prompts the user to enter a, b, c, d, e, and f and displays the result. If ad - bc is 0, report that “The equation has no solution.”

(Q1)This is a Data Structures problem and the programming language used is Lisp. Solve the question we detailed steps and make it concise and easy to understand. Please and thank you.

Using letters H, K, A for the component statements, translate the following compound statements into symbolic notation.a. If the horse is fresh, then the knight will win.b. The knight will win only if the horse is fresh and the armor is strong.c. A fresh horse is a necessary condition for the knight to win.d. The knight will win if and only if the armor is strong.e. A sufficient condition for the knight to win is that the armor is strong or the horse is fresh.