Scribd
Upload
13 views5 pages

Flat MCQ

The document discusses various concepts related to automata theory, including the transitional functions of NFAs and DFAs, the pumping lemma for regular languages, and properties of regular languages. It also covers definitions and characteristics of different types of automata, such as Moore and Mealy machines, and explores closure properties and decidable properties of regular languages. Additionally, it includes questions and answers related to these topics.

Uploaded by

nipunsai yanamadala
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
13 views5 pages

Flat MCQ

The document discusses various concepts related to automata theory, including the transitional functions of NFAs and DFAs, the pumping lemma for regular languages, and properties of regular languages. It also covers definitions and characteristics of different types of automata, such as Moore and Mealy machines, and explores closure properties and decidable properties of regular languages. Additionally, it includes questions and answers related to these topics.

Uploaded by

nipunsai yanamadala
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/ 5

The transitional function of a NFA is

(a) Q X Σ→Q

(b) Q X Σ→2Q

(c) Q X Σ→2n

(d) Q X Σ→Qn

The transitional function of a DFA is

(a) Q X Σ→Q

(b) Q X Σ→2Q

(c) Q X Σ→2n

(d) Q X Σ→Qn

The pumping lemma for regular languages can be used to:

A) Prove that a language is regular

B) Prove that a language is not regular

C) Prove that a language is context-free

D) Prove that a language is context-sensitive

An automaton in which output depends only on the states of the machine is called

a) An automaton without a Memory

b) Automaton with a finite Memory

c) Moore Machine

d) Mealy Machine

An automaton in which output depends only on the states as well as on the input at any

instant of time is called

a) An automaton without a Memory

b) Automaton with a finite Memory


c) Moore Machine

d) Mealy Machine

Regular languages are closed under which of the following operations?

A) Union
B) Intersection
C) Complement
D) All of the above

Which of the following is a decidable property of regular languages?

A) Emptiness
B) Finiteness
C) Membership
D) All of the above
Answer: D) All of the above

Which of the following is not a prefix of abc?

A a) abc b) a c) ab d) bc

Let NFA has a finite number n of states, then DFA will have at most _______ states.

a) n b) 2n c) 2n d) n/2

The regular expression a(a+b)*bb denotes __________.

a) All possible combinations of a’s and b’s b) Set of all strings ending with bb

c) Set of all string starting with a and ending with bb d) None of the above

(Є+00)* = _________

a) a) Є b)0 c) Є.0 d) (00)*

In mealy machine, the Output depends on present state and present input

A grammar is a ________________ device

a) generative b) cognitive c) acceptor d) can’t say

A CFG is denoted by _____________ tuple.

a) 3 b) 4 c) 5 d) 6
language is a set of strings.

Definition of string

Definition of CFG

Two finite state machines are said to be equivalent if they recognize same set of strings

An FSM can be used to add two given integers. [ True / False ]

If L is a regular language, then LR is also a regular language. [ True / False ]

A grammar that produces more than one parse tree of a sentence is known as Ambiguous grammar

(R*S*)*= ___________

(0+1)*denotes set of all strings of 0’s and 1’s

NFA stands for ____________

An automation is a _ _ _ _ _ _ _ _ _ _ _ _ _ device

a. generative b. cognitive c. acceptor d. can't say [B]

Any given transition graphs has an equivalent _ _ _ _ _ _ _ _ _ _ _ _ _

a. RE b. DFA c. NFA d. DFA, NFA & RE [D]

Let maximum number of states in a DFA =128 .Then its equivalent NFA has….. states.

a. 5 b. 7 c. 8 d. 9 [B]

The major difference between a mealy and a moore machine is that

a. The output of the former depends on the present state and present input

b. The output of the former depends only on the presents

c. The output of the former depends only on the present input

d. The output of the former doesn't depends on the present state [B]

Let r, s, t are regular expressions. ( r* )* = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

a. r b. r* c. rr* d. none [B]

In CFG each production is of the form Where A → α , where A ϵ V and α ϵ (VUT)*

State Ardens theorem


State pumping lemma for regular languages

What is a dead state

Prefix and suffix of a string abc

Identity rules of regular expression 2 bits

Closure properties of regular sets

Definition of ambiguous grammar

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