Scribd
Upload
211 views4 pages

Asignment One

The group assignment document outlines 14 questions for a group to answer about deterministic finite automata (DFAs), non-deterministic finite automata (NFAs), and regular languages. The questions include defining key terms, drawing DFAs for specific languages, identifying the languages accepted by sample DFAs, converting NFAs to equivalent DFAs, and identifying components of example automata diagrams.

Uploaded by

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

Asignment One

The group assignment document outlines 14 questions for a group to answer about deterministic finite automata (DFAs), non-deterministic finite automata (NFAs), and regular languages. The questions include defining key terms, drawing DFAs for specific languages, identifying the languages accepted by sample DFAs, converting NFAs to equivalent DFAs, and identifying components of example automata diagrams.

Uploaded by

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

Group assignment

I. Each of the groups must do all the question listed bellow and explain each and every
question as well.

1. Explain the term DFA,NFA and regular language


2. Draw a DFA for the language accepting strings ending with ‘abb’ over input alphabets ∑ =
{a, b}
3. Draw a DFA for the language accepting strings ending with ‘0’ over input alphabets ∑={0,
1} ? 
4. Draw a DFA for the language accepting strings ending with ‘011’ over input alphabets ∑ =
{0, 1} ?
5. Draw a deterministic and non-deterministic finite automate which accept 00 and 11 at the end
of a string containing 0, 1 in it, e.g., 01010100 but not 000111010.
6. Draw a deterministic and non-deterministic finite automata which accept a string containing
“the” anywhere in a string of {a-z}, e.g., “there” but not “those”.
7. Draw a deterministic and non-deterministic finite automata which accept a string containing
“ing” at the end of a string in a string of {a-z}, e.g., “anything” but not “anywhere”.
8. 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’s
d) x is a strings such that it has starting and ending character as 1

9. What does the following figure most correctly represents?

a) Final state with loop x


b) Transitional state with loop x
c) Initial state as well as final state with loop x
d) Insufficient Data
10. Which of the following will not be accepted by the following DFA?

a) ababaabaa
b) abbbaa
c) abbbaabb
d) abbaabbaa
11. Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite
Automata (DFA)-

12. Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite
Automata (DFA)-

13. Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite
Automata (DFA)-
14. Convert the automaton below to a deterministic FA.

You might also like