QUEZON CITY UNIVERSITY

COLLEGE OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

AL102 – AUTOMATA THEORY AND FORMAL LANGUAGE

MIDTERM - ACTIVITY 1
NAME: Bardaje, Marc Luis SCORE PERCENTAGE

STUDENT NO: 18-1433

YEAR/SECTION: SBIT-4A
DATE: FEBRUARY 19,2022

Activity name: GRAPH

Instructions:
 Give the sequences (Nodes and Edges) of
the given graphs 3. Graph Z

1. Graph X

Z = {(1,2,3,4,5,6},
X = {(a,b),(a,d),(b,c),(c,c),(d,d)}
{(1,2), (2,1), (2,3), (3,4), (4,5), (5,1), (5,6), (6,3),
(6,6)}
2. Graph Y

4. Graph A

Y = {(a,d),(b,c),(b,d),(c,c),(d,d)}

A = {(a,b),(b,a),(b,c),(b,g),(c,d),(c,e),(d,e),(d,f),
(d,e),(e,e),(e,f),(f,g),(g,a)}