The Gateway to Computer Science Excellence
0 votes
9 views
Show that the Post Correspondence Problem is decidable over the unary alphabet $\Sigma = \{1\}$.
in Theory of Computation by Veteran (59.2k points) | 9 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,356 answers
198,482 comments
105,252 users