论文信息 - Ranking and unranking left szilard languages

Ranking and unranking left szilard languages

We give efficient ranking and unranking algorithms for left Szilard languages of context-free grammars. If O(n 2) time and space preprocessing is allowed then each ranking operation is possible in linear time. Unranking takes time O(n log n). These algorithms imply similar algorithms for context-free languages generated by arbitrary unambiguous context-free grammars.

Erkki Mäkinen

[1] Robert D. Cameron. Source encoding using syntactic information source models , 1988, IEEE Trans. Inf. Theory.

[2] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[3] Andrew V. Goldberg,et al. Compression and Ranking , 1991, SIAM J. Comput..

[4] Martti Penttonen,et al. Syntax‐directed compression of program files , 1986, Softw. Pract. Exp..

[5] Harry G. Mairson. Generating Words in a Context-Free Language Uniformly at Random , 1994, Inf. Process. Lett..

[6] Wojciech Rytter,et al. Parallel Recognition and Ranking of Context-Free Languages , 1992, MFCS.

[7] Jacques Cohen,et al. Uniform Random Generation of Strings in a Context-Free Language , 1983, SIAM J. Comput..

[8] Erkki Mäkinen,et al. On context-free derivations , 1985 .

[9] Sampath Kannan,et al. A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language , 1997, Inf. Comput..

[10] Etsuro Moriya,et al. Associate Languages and Derivational Complexity of Formal Grammars and Languages , 1973, Inf. Control..