Scribd
Upload
3 views5 pages

Solved IA1 QP

The document outlines the scheme of evaluation for the Theory of Computation course (BCS503), focusing on key concepts such as prerequisites, trap states, finite automata, and dead configurations. It includes definitions and differences between Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA), along with structural representations and examples of transition diagrams and tables. Additionally, it provides exercises for designing DFAs and converting NFAs to DFAs for specific languages.

Uploaded by

sahanasaana19
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
3 views5 pages

Solved IA1 QP

The document outlines the scheme of evaluation for the Theory of Computation course (BCS503), focusing on key concepts such as prerequisites, trap states, finite automata, and dead configurations. It includes definitions and differences between Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA), along with structural representations and examples of transition diagrams and tables. Additionally, it provides exercises for designing DFAs and converting NFAs to DFAs for specific languages.

Uploaded by

sahanasaana19
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/ 5

THEORY OF COMPUTATION (BCS503)

Scheme of Evaluation
Internals I
1. Define the following:
a) Pre-requisites
Symbols: Represent characters or digits
Alphabets: Set of symbols
String: Sequence of symbols
Language: Set of string
b) Trap state
A state from which a finite automaton (FA) or pushdown automaton (PDA)
cannot transit.
c) Finite Automata
An abstract machine that recognizes patterns in input sequences:
d) Dead Configuration
A state where the input string does not transit to further state and ends with ‘∅’
e) Formal definition of DFA and NFA
A Deterministic Finite Automata can be defined as a tuple:
{Q, Σ, q, F, δ}, where:
 Q: Finite set of states
 Σ: Set of input symbols
 q: Initial state
 F: Set of final states
 δ: Transition function given by (δ=Q X Σ Q)
A Non-deterministic Finite Automata can be defined as a tuple:
{Q, Σ, q, F, δ}, where:
 Q: Finite set of states
 Σ: Set of input symbols
 q: Initial state
 F: Set of final states
 δ: Transition function given by (δ=Q X Σ 2 Q)

2. Give the difference between DFA and NFA.

DFA NFA
It has zero or one no. of state It has zero,one or more no. of state
transition at any no. of given state. transition at any no. of given state.
Comparatively difficult to design. Easy to design.
More no. of transitions. Less no. of transitions.
It has only one unique state. It has multiple unique states.
δ is given by (δ=Q X Σ Q) δ is given by (δ=Q XΣ 2 Q)
3. Write the structural representation of Finite automata by considering an
example.

L={Set of all strings over (0,1) such that the string starts with 0}

Transition diagram:

Transition table:

States/Inputs 0 1
A B C
B* B B
C C C

4. Design DFA for the given languageL={Set of all strings over (a,b) such that the
string has exactly one a}
States/Inputs a b
A B A
B* C B
C C C

5. Convert the given NFA to DFA,

States/Inputs a b
A A,B A
B - C
C* - C

States/Inputs a b
A AB A
AB AB AC
AC* AB AC
6. Design DFA for the given languageL={ Set of all strings over (a,b) such that the
string has exactly one a}

States/Inputs a b
A B A
B B C
C B D
D* D D

7. Convert the given NFA to DFA,

States/Inputs a b
A A,B C
B A B
C* - A,B
States/Inputs a b
A AB C
AB AB BC
BC A AB
C D AB
D D D

You might also like