Question: 2 parts: a) Give an algorithm that, given a regular language L, determines whether L = L * b) Give an algorithm that can decide
2 parts:
a) Give an algorithm that, given a regular language L, determines whether L = L*
b) Give an algorithm that can decide whether two regular grammars are equivalent
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
