Ranking and unranking left szilard languages

References

• Cameron , Robert D. 1988 . Source encoding using syntactic information source models . IEEE Trans. Inf. Theor. , IT-34 : 843 – 850 .
   Google Scholar
• Goldberg , Andrew V. and Sipser , Michael . 1985 . Proc. 17th Annual ACM Symp. on Theory of Computing . Compression and ranking . 1985 . pp. 440 – 448 .
   Google Scholar
• Gore , Vivek , Jerrum , Mark , Sampath , Kannan , Sweedyk , Z. and Steve Mahaney , A. 1995 . “ Quasi-polynomial-time algorithm for sampling words from a context-free language ” . In Manuscript
   Google Scholar
• Harrison , M. A. 1978 . Introduction to Formal Language Theory , Addison-Wesley .
   Google Scholar
• Hickey , Timothy and Cohen , Jacques . 1983 . Uniform random generation of strings in a context-free grammar . SIAM J.Compute. , 12 : 645 – 655 .
   Google Scholar
• Huynh , Dung T. 1990 . The complexity of ranking simple languages . Math. Syst. Theory , 23 : 1 – 19 .
   Google Scholar
• Katajainen , Jyrki , Penttonen , Martti and Teuhola , Jukka . 1986 . Syntax-directed compression of program files . Softw. Pract. Exper. , 16 ( 3 ) : 269 – 276 .
   Web of Science ®Google Scholar
• Lange , Klaus-Jörn , Peter , Rossmanith and Wojciech , Rytter . 1992 . Parallel recognition and ranking of context-free languages . Lecture Notes in Computer Science , 629 : 24 – 36 .
   Google Scholar
• Mairson , Harry G. 1994 . Generating words in a context-free language uniformly at random . Inf. Process. Lett. , 49 : 95 – 99 .
   Google Scholar
• Mäkinen , Erkki . 1985 . On context-free derivations . Acta Universitatis Tamperensis , 198
   Google Scholar
• Moriya , Etsuro . 1973 . Associate language and derivational complexity of formal grammars and languages . Inform. Control , 22 : 139 – 162 .
   Google Scholar
• Penttonen , Martti . 1974 . On derivation languages corresponding to context-free grammars . Acta Inform. , 3 : 285 – 291 .
   Google Scholar