Computing Blocker Sets for the Regular Post Embedding Problem

Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these languages and related decision problems.

• Type: Conference
• Year: 2010
• Where: DLT
• Authors: Pierre Chambart, Philippe Schnoebelen
• Keywords: DLT 2010, Post Embedding Problem, Regular Languages, Related Decision Problems, Theoretical Computer Science