期刊
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
卷 140, 期 -, 页码 67-79出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.entcs.2005.06.023
关键词
asymptotic evaluation; probabilistic density; regular language
We define a density of a given language S in a given language L as an asymptotic probability that a randomly and uniformly chosen word of length n from L belongs to S. There are languages for which densities do not exist. We show that a problem of checking whether one regular language has a density in another regular language is decidable.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据