Random generation for finitely ambiguous context-free languages

被引：4
|
作者：
Bertoni, A
Goldwurm, M
Santini, M
机构：
[1] Univ Milan, Dipartimento Sci Informaz, I-20135 Milan, Italy
[2] Univ Modena & Reggio Emilia, Dipartimento Sci Sociali Cognit & Quantitat, I-42100 Reggio Emilia, Italy
来源：
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 2001年 / 35卷 / 06期
关键词：
D O I：
10.1051/ita:2001128
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We prove that a word of length n from a finitely ambiguous context-free language can be generated at random under uniform distribution in O(n(2) log n) time by a probabilistic random access machine assuming a logarithmic cost criterion. We also show that the same problem can be solved in polynomial time for every language accepted by a polynomial time 1-NAuxPDA with polynomially bounded ambiguity.
引用
收藏
页码：499 / 512
页数：14
相关论文
共 50 条
12345