Toward a compositional theory of leftist grammars and transformations
FoSSaCS（2010）
摘要
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as word transformers as a tool toward rigorous analyses of their computational power. Our main contributions in this first paper are (1) constructions proving that leftist transformations are closed under compositions and transitive closures, and (2) a proof that bounded reachability is NP-complete even for leftist grammars with acyclic rules.
更多查看译文
关键词
rigorous analysis,bounded reachability,transitive closure,main contribution,leftist transformation,special semi-thue system,compositional theory,acyclic rule,leftist grammar,computational power,word transformer,automata theory,formal language
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要