@book{dd42d5530a1c4f28b66d5df93348b34c,

title = "Generating All Permutations by Context-Free Grammars in Chomsky Normal Form",

abstract = "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$.",

keywords = "EWI-5756, METIS-221470, IR-63051",

author = "P.R.J. Asveld",

note = "Imported from CTIT",

year = "2004",

month = dec,

language = "Undefined",

series = "CTIT TR-04",

publisher = "Centre for Telematics and Information Technology (CTIT)",

number = "50",

address = "Netherlands",

}