Generating All Permutations by Context-Free Grammars in Chomsky Normal Form

P.R.J. Asveld

    Research output: Book/ReportReportProfessional


    Let $L_n$ be the finite language of all $n!$ strings that are permutations of $n$ different symbols ($n\geq 1$). We consider context-free grammars $G_n$ in Chomsky normal form that generate $L_n$. In particular we study a few families $\{G_n\}_{n\geq1}$, satisfying $L(G_n)=L_n$ for $n\geq 1$, with respect to their descriptional complexity, i.e.\ we determine the number of nonterminal symbols and the number of production rules of $G_n$ as functions of $n$.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages19
    Publication statusPublished - Dec 2004

    Publication series

    NameCTIT TR-04
    PublisherUniversity of Twente, Centre for Telematics and Information Technology (CTIT)
    ISSN (Print)1381-3625


    • EWI-5756
    • METIS-221470
    • IR-63051

    Cite this