Computing Blocker Sets for the Regular Post Embedding Problem [chapter]

Pierre Chambart, Philippe Schnoebelen
2010 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-14455-4_14 fatcat:axzobqizvnce7j6rnaisyn7l54