Can you help with the questions on prolog and finite automata?

Prolog means logic programming language related to artificial intelligence and computational symbolic linguistics with an application to define the functional objects leading to simulations and automation. Finite automata should have two arguments one input and other output and return to the states by which it passed through. read less

Here are the top 10 frequently asked MCQ Questions on Finite Automata::1. Which of the following not an example Bounded Information?a) fan switch outputs {on, off}b) electricity meter readingc) colour of the traffic light at the momentd) none of the mentioned2. A Language for which no DFA exist is a________a) Regular Languageb) Non-Regular Languagec) May be Regulard) Cannot be said3. A DFA cannot be represented in the following formata) Transition graphb) Transition Tablec) C coded) None of the mentioned4. What the following DFA accepts?a) x is a string such that it ends with ‘101’b) x is a string such that it ends with ‘01’c) x is a string such that it has odd 1’s and even 0’sd) x is a strings such that it has starting and ending character as 15. When are 2 finite states equivalent?a) Same number of transitionsb) Same number of statesc) Same number of states as well as transitionsd) Both are final states6. What does the following figure most correctly represents?a) Final state with loop xb) Transitional state with loop xc) Initial state as well as final state with loop xd) Insufficient Data7. Which of the following will not be accepted by the following DFA?a) ababaabaab) abbbaac) abbbaabbd) abbaabbaa8. Which of the following will the given DFA won’t accept?a) εb) 11010c) 1000 1010d) String of letter count 119. Can a DFA recognize a palindrome number?a) Yesb) Noc) Yes, with input alphabet as ∑*d) Can’t be determined10. Which of the following is not an example of finite state machine system?a) Control Mechanism of an elevatorb) Combinational Locksc) Traffic Lightsd) Digital Watches read less