Computing Blocker Sets For The Regular Post Embedding Problem

DLT'10: Proceedings of the 14th international conference on Developments in language theory（2010）

引用 4|浏览2

暂无评分

摘要

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.

查看译文

关键词

Regular Expression, Regular Language, Monoidal Structure, Constraint Language, Counter Machine

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要