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

Asveld, P.R.J. (2003) Generating All Permutations by Context-Free Grammars in Chomsky Normal Form. In: Algebraic Methods in Language Processing (AMiLP 2003), Proceedings 3rd AMAST Workshop on Language Processing, August 25-27, 2003, Verona, Italy.

Preview

PDF
203Kb

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\geq 1}$ , 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 function of $n$ .
Item Type:	Conference or Workshop Item
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:	http://purl.utwente.nl/publications/67594
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page