Scribd
Upload
26 views2 pages

Flat Bits

The document contains a series of multiple-choice questions related to finite state machines, regular languages, and automata theory. It covers topics such as properties of languages, grammar forms, and characteristics of different types of machines. Each question provides options for answers, testing knowledge in theoretical computer science.

Uploaded by

kritisony83
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views2 pages

Flat Bits

The document contains a series of multiple-choice questions related to finite state machines, regular languages, and automata theory. It covers topics such as properties of languages, grammar forms, and characteristics of different types of machines. Each question provides options for answers, testing knowledge in theoretical computer science.

Uploaded by

kritisony83
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

If L1 & L2 finite regular languages then


a) L1 ⋃ L2 is Regular b) L1 ∩ L2 is Regular c) Both A and B d) None

2. There are ________ tuples in finite state machine.


a)4 b) 5 c) 6 d) 3

3. Prefix of string ‘abc’ is


a) abc only b) ∈, a,ab,abc c) Bc d) ab

4. Decision properties are used to


a) To test the whether the language is regular or not
b) To test the emptiness of regular languages
c) Both A and B
d) None

5. Transition function of ∈- NFA is given by:


a) Q X ΣU{ ∈ }-> 2 power Q b) Σ X Q-> Σ c) Σ * Σ -> Q d) Q X Σ-> 2 power Q

6. Form of Regular Grammar is___, where A, B ∈ V, x ∈ T*


a) A→ Bx b) A→ xB c) A→ x d) All of the mentioned

7. In Moore machine, output is produced over the change of:


a) States b) transitions c) both d) none

8. In characteristic equation R = Q + RP, if P is free from epsilon, then it has a solution given by
a) R=P*Q b) R=QP* c) R=Q* d) It has an infinite solution

9. Consider the following language, L= {w∣w∈ {0,1}* and w is palindrome}. Which of the
following grammar generates the above language?
A)S→0S0S|1S1S|ϵ B) S→0S0|1S1|ϵ C) S→0S0|1S1|0|1|ϵ D) S→0S0|1S1|0|1

10. A --------- is a finite sequence of symbols


a) Automata b) Set c) String d) Sentence

11. The state that is not reachable from the initial state of the DFA, for any input string
A) Dead state B) Unreachable state C) Final state D) Trap state

12. Let L = {w | w has even length and odd number of 0’s}. Which of the following word is in L ∗?
A)0000 B)011 C)010 D)111101

13. What is the language corresponding to the following regular expression? (0+1) ∗(10)(0+1)∗
A) {w∣w contains 10 as substring} B) {w∣w∈ {0,1}∗} C) {w∣ length of w is ≥1} D) None

14. Number of tuples in NFA


A)3 B)4 C)5 D)6

15. String generated from the regular expression ab*


A) aab B) babbb C) ab D) abbba

16. Which of the following is right linear grammar


a) S—> aA, A—> aA | b b)A→ A0 | 1 c) S—> A0 A—> A1 | 1 d) None

17. Let L1 and L2 be languages such that there exist a DFA for accepting L1 ∪ L2. Which of the
following statements is necessarily true?
A)There exists a DFA which accepts (L1 ∪ L2)∗
B) There exists a DFA which accepts L1
C)There exists a DFA which accepts L1 ∩ L2
D)There exists a DFA which accepts L2

18. Consider the following grammar,


S→AaA
A→bA|Ab|Ac|cA|aaA|Aaa|aAa|ϵ
Which of the following strings is not generated by the above grammar?
A) a B) bab C) abc D) aa

19. True about Mealy and Moore machine


A) Mealy is deterministic and Moore is Non deterministic
B) Both have output functions
C)Both A & B are true
D) None

20.Let L be a language accepted by a DFA with q states. Which of the following statements is
necessarily true?
A) Every NFA which accepts L requires at least 2q states
B)The number of strings in L is q − 1
C)There exists a NFA with q or less states which accepts L
D)The number of strings in L is q + 1

21. Transition Diagram is a directed graph associated with Finite Automata.


22. Number of tuples in CFG (G) 4.
23. Language for following RE a(a+b*) All strings start with a.
24. Number of tuples in DFA 5.

25. Mealy and Moore machines are deterministic in nature.

26. |abaɛba| = _5_.

27. mealy and moore machines are output generators.

28. The output alphabet can be represented as: ∆.


29. ∑+ ∪{ɛ}= Σ*.
30. If we have ‘n’ states in NFA then in worst case we have 2n states in DFA.
31. Regular Grammar is Type 3.

32.L={ ϵ,a,aa,aaa, ………} is represented by L* = a*.


33. Two FA’s are said to be equal if they accept same set of strings over Σ
34. (R1+R2)* is = (R1*R2*)* || (R1*+R2*)*.
35. The language corresponding to the regular expression ∅(0+1)∗∪∅∗is ∅.
36. NFA stands for Non-deterministic Finite Automata.

37. Let Σ = {a, b, c, d}. How many strings are there in Σ4 44=256.

38. All the intermediate steps in deriving a string is called sentential forms.

39. In G=(V,T,P,S), V is set of variables.

40. Length of empty string ∈ |∈| is 0.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy