Ranking and unranking left szilard languages
From MaRDI portal
Publication:4392895
DOI10.1080/00207169808804677zbMath0897.68059MaRDI QIDQ4392895
Publication date: 19 October 1998
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169808804677
68Q45: Formal languages and automata
Cites Work
- Unnamed Item
- Generating words in a context-free language uniformly at random
- On derivation languages corresponding to context-free grammars
- The complexity of ranking simple languages
- Uniform Random Generation of Strings in a Context-Free Language
- Associate languages and derivational complexity of formal grammars and languages