加载中…
2011-03-08
Decidability and Shortest Strings in Formal Languages
Levent AlpogeThomas AngLuke SchaefferJeffrey Shallit
文献摘要
Given a formal language L specified in various ways, we consider the problem of determining if L is nonempty. If L is indeed nonempty, we find upper and lower bounds on the length of the shortest string in L.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本