Theory of Autamata 4

ASSIGNMENT/ASSESSMENT COVER SHEET
Student Name: Imran Hakeem
FIRST NAME FAMILY / LAST NAME
Registration Number: BSCS-023R13-191
Course Code Course Title
Theory of Autamata
Department (Computer Science / Information Technology)
Computer Science
Class & Semester BSCS 7th
Assessment Item Title: 04 Due Date/Time: 20-05-20

Due Date/Time 06-05-20:
Tutorial Group (If applicable): Word Count (If applicable):

Lecturer/Tutor Name: Zia Ur Rehman
Extension Granted: Yes No Granted By:
I declare that this assessment item is my own work unless otherwise acknowledged and is
in accordance with the University’s academic integrity policy.
I certify that this assessment item has not been submitted previously for academic credit in
this or any other course. I certify that I have not given a copy or have shown a copy of this
assessment item to another student enrolled in the course.
I acknowledge that the assessor of this assignment may, for the purpose of assessing this
assignment:
 Reproduce this assessment item and provide a copy to another member of the Faculty; and/or
 Communicate a copy of this assessment item to a plagiarism checking service (which may then
retain a copy of the item on its database for the purpose of future plagiarism checking).
 Submit the assessment item to other forms of plagiarism checking.
I certify that any electronic version of this assessment item that I have submitted or will
submit is identical to this paper version.
Signature: Imran Hakeem Date: 20-08-20
Using ten transition diagram explain FA?
A finite automaton (FA) is a simple idealized machine used to recognize patterns within input
taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input
depending on whether the pattern defined by the FA occurs in the input.
A finite automaton consists of:
 a finite set S of N states

 a special start state
 a set of final (or accepting) states
 a set of transitions T from one state to another, labeled with chars in C
As noted above, we can represent a FA graphically, with nodes for states, and arcs for
transitions.
We execute our FA on an input sequence as follows:
 Begin in the start state

 If the next input char matches the label on a transition from the current state to a new
state, go to that new state
 Continue making transitions on each input char
o If no move is possible, then stop
o If in accepting state, then accept
Programs from FA
It is fairly straightforward to translate an FA into a program. Consider a 4-state FA to recognize

"main" in a program.
 Let FA = {S,C,T,s0,F}
 S = {s0, s1, s2, s3, s4}
 C = {a,b,..z,A,B,..Z,0,1,..9,+,-,*,/}
 F = {s4}
 T = {(s0,m,s1), (s0,C-m,s0),
(s1,a,s2), (s1,m,s1), (s1,C-a-m,s0),
(s2,i,s3), (s2,m,s1), (s2,C-i-m,s0),
(s3,n,s4), (s3,m,s1), (s3,C-n-m,s0), (s4,C,s4)}
We can easily create a program from this description of the FA. We will use statement labels to
represent states and goto's to represent the meaning of an arc. (In general, goto's are discouraged,
but this is one case where their use is not only reasonable, it is quite common.) The variable
"accept" is true if the FA accepts, and is false otherwise.
s: accept = false; cin >> char;

if char = "m" goto m;
if char = EOF goto end;
goto s;
m: accept = false; cin >> char;
if char = "a" goto a;
goto s;
a: accept = false; cin >> char;
if char = "i" goto i;
goto s;
i: accept = false; cin >> char;
if char = "n" goto n;
goto s;
n: accept = true; while (cin >> char);
end: cout << accept;
Transition Diagram
A transition diagram or state transition diagram is a directed graph which can be constructed as
follows:
o There is a node for each state in Q, which is represented by the circle.

o There is a directed edge from node q to node p labeled a if δ(q, a) = p.
o In the start state, there is an arrow with no source.
o Accepting states or final states are indicating by a double circle.
Some Notations that are used in the transition diagram:

There is a description of how a DFA operates:
1. In DFA, the input to the automata can be any string. Now, put a pointer to the start state q and
read the input string w from left to right and move the pointer according to the transition
function, δ. We can read one symbol at a time. If the next symbol of string w is a and the pointer
is on state p, move the pointer to δ(p, a). When the end of the input string w is encountered, then
the pointer is on some state F.
2. The string w is said to be accepted by the DFA if r ∈ F that means the input string w is
processed successfully and the automata reached its final state. The string is said to be rejected
by DFA if r ∉ F.
Example
DFA with ∑ = {0, 1} accepts all strings starting with 1.
Solution:
The finite automata can be represented using a transition graph. In the above diagram, the
machine initially is in start state q0 then on receiving input 1 the machine changes its state to q1.
From q0 on receiving 0, the machine changes its state to q2, which is the dead state. From q1 on
receiving input 0, 1 the machine changes its state to q1, which is the final state. The possible
input strings that can be generated are 10, 11, 110, 101, 111......., that means all string starts with
1.
Example
NFA with ∑ = {0, 1} accepts all strings starting with 1.
Solution:
The NFA can be represented using a transition graph. In the above diagram, the machine initially
is in start state q0 then on receiving input 1 the machine changes its state to q1. From q1 on
receiving input 0, 1 the machine changes its state to q1. The possible input string that can be
generated is 10, 11, 110, 101, 111......, that means all string starts with 1.

Theory of Autamata 4

Uploaded by

Copyright:

Available Formats

Theory of Autamata 4

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Theory of Autamata 4

Uploaded by

Copyright:

Available Formats

ASSIGNMENT/ASSESSMENT COVER SHEET

Student Name: Imran Hakeem

FIRST NAME FAMILY / LAST NAME

Registration Number: BSCS-023R13-191

Course Code Course Title

Department (Computer Science / Information Technology)

Class & Semester BSCS 7th

Assessment Item Title: 04 Due Date/Time: 20-05-20

Tutorial Group (If applicable): Word Count (If applicable):

Extension Granted: Yes No Granted By:

Signature: Imran Hakeem Date: 20-08-20

Using ten transition diagram explain FA?

A finite automaton consists of:

 a finite set S of N states

We execute our FA on an input sequence as follows:

 Begin in the start state

It is fairly straightforward to translate an FA into a program. Consider a 4-state FA to recognize

s: accept = false; cin >> char;

o There is a node for each state in Q, which is represented by the circle.

Some Notations that are used in the transition diagram:

NFA with ∑ = {0, 1} accepts all strings starting with 1.

You might also like

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