27
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Ranking and unranking left szilard languages

Pages 29-38 | Received 24 Jan 1996, Published online: 19 Mar 2007
 

Abstract

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.

C.R. Categories:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.