Quiz 1: Introduction To Finite Automata
10 Questions
| Total Attempts: 1386
A finite automaton is a state machine that takes a string of symbols as input and changes its state accordingly. When a regular expression string is fed into finite automata, it changes its state for each literal. If you think you know the basics, take the quiz below. Good luck!
Questions and Answers
- 1.DFA stands for?
- 2.Give a Regular Expression for: L = {0i 1j | i is even and j is odd }
- A.
(00)∗0(11)∗
- B.
(00)∗1(11)∗
- C.
(00)∗10(11)∗
- D.
None
- 3.A DFA has infinite number of states
- A.
True
- B.
False
- 4.Given the language L = {ab, aa, baa}, which of the following strings are in L*?
- A.
Abaabaaabaa
- B.
Aaaabaaaa
- C.
Baaaaabaaaab
- D.
Baaaaabaa
- 5.Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
- A.
The set of all strings containing the substring 00
- B.
The set of all strings containing at most two 0’s
- C.
The set of all strings containing at least two 0’s
- D.
The set of all strings that begin and end with either 0 or 1
- 6.There are ________ tuples in finite state machine
- A.
4
- B.
5
- C.
6
- D.
Unlimited
- 7.Number of states require to accept string ends with 10.
- A.
3
- B.
2
- C.
1
- D.
Can't be represented
- 8.Regular expression for all strings starts with ab and ends with bba is
- A.
Aba*b*bba
- B.
Ab(ab)*bba
- C.
Ab(a+b)*bba
- D.
All of the mentioned
- 9.
Among the 4 strings listed, which one is rejected by the DFA- A.
Baaaab
- B.
Aaaaab
- C.
Aabb
- D.
Abbab
- 10.
Which of the following is FALSE?1) L(A) = L((11*0+0)(0 + 1)*0*1*)2) A accepts all strings over {0, 1} of length at least 2
- A.
1
- B.
2
- C.
1 and 2
- D.
None
How good are your communication skills? Do you know how to introduce yourself in various scenarios? Check out this quiz and learn different ways to introduce yourself. This test contains crucial questions about greetings and...
Questions: 10 | Attempts: 5349 | Last updated: Apr 24, 2022
-
Sample QuestionJames Smith is a doctor. Which one of these is the most formal way he could introduce himself?
Questions: 15 | Attempts: 5158 | Last updated: Mar 22, 2022
-
Sample QuestionYou meet your principal at seven p.m. What would you say?
Introduction to the League of Nations: text p. 228-235
Questions: 11 | Attempts: 1707 | Last updated: Mar 22, 2022
-
Sample QuestionWhat yeardid the League of Nations begin?