(Erasing)* strings

1. Y. Bar-Hillel, M. Perles, and E. Shamir, On formal properties of simple phrase structure grammars, Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung 14 (1961), 143–172. Reprinted as Chapter 9 in Y. Bar-Hillel (ed.), Language and Information, Addison-Wesley, 1964.

   Google Scholar 

2. M. Benois and Y. Cochet, Congruences quasi-parfaites sur le monoide libre: algébre et combinatoire, manuscript.

   Google Scholar 

3. J. Berstel, Congruences plus que parfaites et languages algébriques, Seminaire d'Informatique Théorique (1976–77), Institut de Programmation, 123–147.

   Google Scholar 

4. R. Book, Confluent and other types of Thue systems, J. Assoc. Comput. Mach., to appear.

   Google Scholar 

5. Y. Cochet, Sur l'algébricité des classes de certaines congruences définies sur le monoide libre, Thèse 3^e cycle, Rennes, 1971.

   Google Scholar 

6. Y. Cochet and M. Nivat, Une generalization des ensembles de Dyck, Israel J. Math. 9 (1971), 389–395.

   Google Scholar 

7. S. Greibach, Full AFLs and nested iterated substitution, Info. Control 16 (1970), 7–35.

   Article  Google Scholar 

8. G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, J. Assoc. Comput. Mach. 27 (1980), 797–821.

   Google Scholar 

9. M. Jantzen, On a special monoid with a single defining relation, Theoretical Computer Science, to appear.

   Google Scholar 

10. J. Král, A modification of substitution theorem and some necessary and sufficient conditions for sets to be context-free, unpublished manuscript.

    Google Scholar 

11. M.H.A. Newman, On theories with a combinatorial definition of “equivalence,” Annals Math. 43 (1942), 223–243.

    Google Scholar 

12. M. Nivat, On some families of languages related to the Dyck languages, 2nd ACM Symp. Theory Computing (1970), 221–225.

    Google Scholar 

13. M. Nivat (wtih M. Benois), Congruences parfaites et quasi-parfaites, Seminaire Dubreil, 25^e Année (1971–72), 7-01-09.

    Google Scholar 

14. P. Raulefs, J. Siekmann, P. Szabo, and E. Unvericht, A short survey on the state of the art in matching and unifcation problems, SIGSAM Bulletin 13 (1979), 14–20.

    Google Scholar 

15. B. Rosen, Tree manipulating systems and Church-Rosser systems, J. Assoc. Comput. Mach. 20 (1973), 160–187.

    Google Scholar 

Download references