Question: Let S = { 0 , 1 , 2 , 3 , . . . , 9 , - , = } and SUB =
Let S and
SUB xyz xyz are unsigned integers, and z is the difference of x and y
For example, string is in SUB, while string is not in SUB.
Prove that SUB is not a regular language.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
