Back to University of Twente portal
Generating All Permutations by Context-Free Grammars in Chomsky Normal Form (Extended version)
Asveld, P.R.J. (2004) Generating All Permutations by Context-Free Grammars in Chomsky Normal Form (Extended version). [Report]
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 195Kb |
| Abstract: | Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ¿ 1). We consider contextfree grammars Gn in Chomsky normal form that generate Ln. In particular we study a few families |
| Item Type: | Report |
| Copyright: | ©2004 CTIT |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/49272 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page
Metis ID: 221470