solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看12363次
Generation and analysis of lamplighter programs. (arXiv:1707.02652v2 [cs.DM] UPDATED)
来源于:arXiv
We consider a programming language based on the lamplighter group that uses
only composition and iteration as control structures. We derive generating
functions and counting formulas for this language and special subsets of it,
establishing lower and upper bounds on the growth rate of semantically distinct
programs. Finally, we show how to sample random programs and analyze the
distribution of runtimes induced by such sampling. 查看全文>>