Permutations of context-free, ET0L and indexed languages
For a language $L$, we consider its cyclic closure, and more generally the language $C^{k}(L)$, which consists of all words obtained by partitioning words from $L$ into $k$ factors and permuting them. We prove that the classes of ET0L and EDT0L languages are closed under the operators $C^k$. This bo...
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Discrete Mathematics & Theoretical Computer Science
2016-05-01
|
| Serie: | Discrete Mathematics & Theoretical Computer Science |
| Soggetti: | |
| Accesso online: | https://dmtcs.episciences.org/2164/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|