Sciweavers

Share
DLT
2010

Computing Blocker Sets for the Regular Post Embedding Problem

11 years 9 months ago
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.
Pierre Chambart, Philippe Schnoebelen
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2010
Where DLT
Authors Pierre Chambart, Philippe Schnoebelen
Comments (0)
books