Generating all permutations by context-free grammars in Chomsky normal form

Share/Save/Bookmark

Asveld, P.R.J. (2004) Generating all permutations by context-free grammars in Chomsky normal form. [Report]

[img] PDF
Restricted to UT campus only

200kB
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$.
Item Type:Report
Additional information:Imported from CTIT
Copyright:© 2004 CTIT
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63051
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 221470