Cutting Through Regular Post Embedding Problems

Details Cutting Through Regular Post Embedding Problems Cutting Through Regular Post Embedding Problems

2011-09-08

arxiv.org/abs/1109.1691v3

Computer Science

Logic in Computer Science

Scientific paper

The Regular Post Embedding Problem extended with partial (co)directness is
shown decidable. This extends to universal and/or counting versions. It is also
shown that combining directness and codirectness in Post Embedding problems
leads to undecidability.

Affiliated with

Also associated with

No associations

Rating

Cutting Through Regular Post Embedding Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cutting Through Regular Post Embedding Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cutting Through Regular Post Embedding Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-475105