Question: Show that the Post Correspondence Problem is decidable over the unary alphabet = {1}.
Show that the Post Correspondence Problem is decidable over the unary alphabet Σ = {1}.
Step by Step Solution
3.51 Rating (168 Votes )
There are 3 Steps involved in it
Consider the DFA M with start state q0 and set of accept states F Let q1 be the state that M transit... View full answer
Get step-by-step solutions from verified subject matter experts
