MIX Is Not a Tree-Adjoining Language
Résumé
The language MIX consists of all strings over the three-letter alphabet {a,b,c} that contain an equal number of occurrences of each letter. We prove Joshi's (1985) conjecture that MIX is not a tree-adjoining language.
Domaines
Théorie et langage formel [cs.FL]
Origine : Accord explicite pour ce dépôt
Loading...