This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
M. Benois and Y. Cochet, Congruences quasi-parfaites sur le monoide libre: algébre et combinatoire, manuscript.
J. Berstel, Congruences plus que parfaites et languages algébriques, Seminaire d'Informatique Théorique (1976–77), Institut de Programmation, 123–147.
R. Book, Confluent and other types of Thue systems, J. Assoc. Comput. Mach., to appear.
Y. Cochet, Sur l'algébricité des classes de certaines congruences définies sur le monoide libre, Thèse 3e cycle, Rennes, 1971.
Y. Cochet and M. Nivat, Une generalization des ensembles de Dyck, Israel J. Math. 9 (1971), 389–395.
S. Greibach, Full AFLs and nested iterated substitution, Info. Control 16 (1970), 7–35.
G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, J. Assoc. Comput. Mach. 27 (1980), 797–821.
M. Jantzen, On a special monoid with a single defining relation, Theoretical Computer Science, to appear.
J. Král, A modification of substitution theorem and some necessary and sufficient conditions for sets to be context-free, unpublished manuscript.
M.H.A. Newman, On theories with a combinatorial definition of “equivalence,” Annals Math. 43 (1942), 223–243.
M. Nivat, On some families of languages related to the Dyck languages, 2nd ACM Symp. Theory Computing (1970), 221–225.
M. Nivat (wtih M. Benois), Congruences parfaites et quasi-parfaites, Seminaire Dubreil, 25e Année (1971–72), 7-01-09.
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.
B. Rosen, Tree manipulating systems and Church-Rosser systems, J. Assoc. Comput. Mach. 20 (1973), 160–187.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Book, R., Jantzen, M., Wrathall, C. (1981). (Erasing)* strings. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017317
Download citation
DOI: https://doi.org/10.1007/BFb0017317
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive