Immunity and pseudorandomness of context-free languages
Immunity and pseudorandomness of context-free languages
复制标题
上下文无关语言的免疫性和伪随机性
DOI:
10.1016/j.tcs.2011.07.013
复制
发表时间:
2009
期刊:
影响因子:
--
通讯作者:
T. Yamakami
中科院分区:
文献类型:
--
作者:
T. Yamakami
We discuss the computational complexity of context-free languages, concentrating on two well-known structural properties—immunity and pseudorandomness. An infinite language is REG-immune (resp., CFL-immune) if it contains no infinite subset that is a regular (resp., context-free) language. We prove that (i) there is a context-free REG-immune language outside REG/n and (ii) there is a REG-bi-immune language that can be computed deterministically using logarithmic space. We also show that (iii) there is a CFL-simple set, where a CFL-simple language is an infinite context-free language whose complement is CFL-immune. Similar to the REG-immunity, a REG-primeimmune language has no polynomially dense subsets that are also regular. We further prove that (iv) there is a context-free language that is REG/n-bi-primeimmune. Concerning pseudorandomness of context-free languages, we show that (v) CFL contains REG/n-pseudorandom languages. Finally, we prove that (vi) against REG/n, there exists an almost 1–1 pseudorandom generator computable in nondeterministic pushdown automata equipped with a write-only output tape and (vii) against REG, there is no almost 1–1 weakly pseudorandom generator computable deterministically in linear time by a single-tape Turing machine.
DOI:
10.1016/j.tcs.2009.08.031
发表时间:
2003-10
期刊:
ArXiv
影响因子:
--
作者:
K. Tadaki;T. Yamakami;Jack C. H. Lin
通讯作者:
K. Tadaki;T. Yamakami;Jack C. H. Lin
DOI:
--
发表时间:
2005
期刊:
Theoretical Computer Science 347
影响因子:
--
作者:
M.Kumabe;T.Suzuki;T.Yamazaki;Tomoyuki Yamakami(Toshio Suzukiと連名)
通讯作者:
Tomoyuki Yamakami(Toshio Suzukiと連名)