Scribd
Upload
592 views

Automata Theory IIB: Questions Answers (DFA-NFA)

This document contains 14 questions and answers about automata theory and regular languages. It asks the reader to construct deterministic and non-deterministic finite automata to recognize various languages over the alphabets {a,b} and {0,1}. It also asks the reader to determine regular expressions that define languages recognized by given finite automata.

Uploaded by

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

Automata Theory IIB: Questions Answers (DFA-NFA)

This document contains 14 questions and answers about automata theory and regular languages. It asks the reader to construct deterministic and non-deterministic finite automata to recognize various languages over the alphabets {a,b} and {0,1}. It also asks the reader to determine regular expressions that define languages recognized by given finite automata.

Uploaded by

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

AUTOMATA

THEORY
II B
Questions Answers(DFA-NFA)

Automata Theory II B

Q.For = {a, b} construct DFA that accepts


all strings with exactly one a .
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.For = {a, b} construct DFA that accepts


all strings with at least one a .
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.For = {a, b} construct DFA that accepts


all strings with no more than three as.
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.For = {a, b} construct DFA that accepts


all strings with at least one a and exactly
two bs.
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.Determine a DFA that accepts all strings on


{0, 1} except those containing the
substring 001.
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.Obtain the NFA for a language defined by


L = {anbm | n,m 1}
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.Construct an NFA for the state table given


below.

A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.Obtain the language recognized by the NDA


shown below.

A.

L = { 0n, 0n01, 0n11 | n 0

Dept. of Computer Science & IT, FUUAST


Theory

Automata

Automata Theory II B

Q.Determine the DFA that accepts the


language
L(aa* + aba* + b*)
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

10

Automata Theory II B

Q.Determine the DFA that accepts the


language
L(ab(a + ab*(a + aa)))
A.

Dept. of Computer Science & IT, FUUAST


Theory

Automata

11

Automata Theory II B

Q.Determine the regular expression for the


language accepted by the following
automaton.

A.

L = b*.aa*.ab*.a

Dept. of Computer Science & IT, FUUAST


Theory

Automata

12

Automata Theory II B

Q.Determine the regular expression for the


language accepted by the following
automaton.

A.

L = (aabb)* + b(bab)*.(ba)*b + (ab)*

Dept. of Computer Science & IT, FUUAST


Theory

Automata

13

Automata Theory II B

Q.Determine the regular expression for the


language accepted by the following
automaton.

A.

L = a*.ba*

Dept. of Computer Science & IT, FUUAST


Theory

Automata

14

END

You might also like