On Some Families of Languages Related to the Dyck Language

@inproceedings{Nivat1970OnSF,
  title={On Some Families of Languages Related to the Dyck Language},
  author={Maurice Nivat},
  booktitle={STOC},
  year={1970}
}
We recall that the Dyck language on the alphabet of 2n letters X &equil; {x<subscrpt>1</subscrpt>,...,x<subscrpt>n</subscrpt>,&xmarc;<subscrpt>1</subscrpt>,...,&xmarc;<subscrpt>n</subscrpt>} is the equivalence class of the empty word 1 ε X@@@@ modulo the Thue congruence generated on X@@@@ by the 2n relations x<subscrpt>i</subscrpt>&xmarc;<subscrpt>i</subscrpt> &equil; &xmarc;<subscrpt>i</subscrpt>x<subscrpt>i</subscrpt> &equil; 1 i ε {1,...,n}. Indeed for all n ε X@@@@ the equivalence class of… CONTINUE READING

Similar Papers

Loading similar papers…