University of Engineering and Technology Peshawar

Department of Computer Science and Information

1|Page
1. What is state elimination technique? How to convert given automaton into a regular
expression? Give a short example to support your answer.
Answer:
State Elimination Technique
The state elimination technique is a method used to convert a given finite automaton (FA)
into an equivalent regular expression. It works by systematically eliminating states from the
FA, modifying the remaining transitions to reflect the eliminated state's behavior. This
process continues until only the start and final states remain, and the label on the edge
between them represents the desired regular expression.
Steps:
1. Choose a state to eliminate: Select an intermediate state (not the start or final state) to
eliminate.
2. Identify incoming and outgoing transitions: Determine all transitions entering and
leaving the chosen state.
3. Modify transitions:
o For each pair of incoming and outgoing transitions, create a new transition directly
between their respective source and destination states.
o The label of the new transition is formed by concatenating the labels of the
incoming and outgoing transitions, with the Kleene star applied to the loop on the
eliminated state (if any).
4. Remove the eliminated state and its associated transitions.
5. Repeat: Continue eliminating states until only the start and final states remain.
6. Extract the regular expression: The label on the final edge between the start and final
states represents the regular expression equivalent to the original FA.
Example:
Consider the following DFA:

DFA with three states: start state, intermediate state, and final state
To convert this DFA into a regular expression, we can eliminate the intermediate state:
1. Identify incoming and outgoing transitions:

2|Page
 o Incoming transition: a
o Outgoing transitions: b (self-loop), c (to final state)
2. Modify transitions:
o Create a new transition from the start state to the final state labeled with a(b*c).
3. Remove the intermediate state and its associated transitions.
The resulting FA has only the start and final states connected by a single edge labeled with
a(b*c). Therefore, the regular expression equivalent to the original DFA is a(b*c).
By following the state elimination technique, we can systematically derive regular
expressions from finite automata, providing a valuable tool for understanding and
manipulating formal languages.

2. What is the relation between Context Free Grammar and a transition graph?
Give example for each and convert a given TG into corresponding grammar.
Answer:
Relationship Between Context-Free Grammars (CFGs) and Transition Graphs
While seemingly di erent, CFGs and transition graphs are closely related in their ability to
describe formal languages.
 CFGs: A CFG is a set of rules that define how to generate strings in a language. They use
variables (non-terminals) to represent intermediate stages of the derivation process.
 Transition Graphs: A transition graph is a visual representation of a finite state machine,
where nodes represent states and edges represent transitions between states, often
labeled with input symbols.
Key Connection:
 Both describe languages: Both CFGs and transition graphs can be used to define the
same sets of strings, i.e., languages.
 Conversion: Under certain conditions, you can convert a CFG into a corresponding
transition graph, and vice versa.
Example: CFG
Consider the following CFG:
S -> aS | bA
A -> bA | a
This CFG generates strings that start with any number of 'a's, followed by at least one 'b',
and then any number of 'a's and 'b's.
Example: Transition Graph
[Image of a transition graph with two states: S and A.
 From S, there's a self-loop labeled 'a' and a transition to A labeled 'b'.
 From A, there's a self-loop labeled 'b' and a transition to S labeled 'a'.]
This transition graph represents the same language as the CFG above.

3|Page
 Converting a Transition Graph to a CFG:
1. Assign Non-terminals: Assign a unique non-terminal to each state in the graph.
2. Define Productions: For each edge in the graph:
o If the edge goes from state X to state Y with label 'a', create a production: X -> aY
o If the edge is a self-loop on state X with label 'a', create a production: X -> aX
o If the edge represents the final state (let's say it's state F), create a production: F ->
ε (epsilon, representing the empty string)
Example: Converting a Transition Graph to CFG
Given a transition graph with states S (start), A, and F (final):
[Image of a transition graph with three states: S, A, and F.
 From S, there's a transition to A labeled 'a' and a self-loop labeled 'b'.
 From A, there's a transition to F labeled 'a'.]
The corresponding CFG would be:
S -> aA | bS
A -> aF
F -> ε
Conclusion:
 Not all transition graphs can be directly converted into CFGs.
 For more complex graphs, the conversion process might involve introducing additional
non-terminals or using more intricate rules.

The End Assignment 3

4|Page