{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:37Z","timestamp":1725455857930},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017317","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:22:34Z","timestamp":1132626154000},"page":"252-260","source":"Crossref","is-referenced-by-count":1,"title":["(Erasing)* strings"],"prefix":"10.1007","author":[{"given":"R.","family":"Book","sequence":"first","affiliation":[]},{"given":"M.","family":"Jantzen","sequence":"additional","affiliation":[]},{"given":"C.","family":"Wrathall","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","first-page":"143","volume":"14","author":"Y. Bar-Hillel","year":"1961","unstructured":"Y. Bar-Hillel, M. Perles, and E. Shamir, On formal properties of simple phrase structure grammars, Zeitschrift f\u00fcr Phonetik, Sprachwissenschaft, und Kommunikationsforschung 14 (1961), 143\u2013172. Reprinted as Chapter 9 in Y. Bar-Hillel (ed.), Language and Information, Addison-Wesley, 1964.","journal-title":"Zeitschrift f\u00fcr Phonetik, Sprachwissenschaft, und Kommunikationsforschung"},{"key":"29_CR2","unstructured":"M. Benois and Y. Cochet, Congruences quasi-parfaites sur le monoide libre: alg\u00e9bre et combinatoire, manuscript."},{"key":"29_CR3","unstructured":"J. Berstel, Congruences plus que parfaites et languages alg\u00e9briques, Seminaire d'Informatique Th\u00e9orique (1976\u201377), Institut de Programmation, 123\u2013147."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"R. Book, Confluent and other types of Thue systems, J. Assoc. Comput. Mach., to appear.","DOI":"10.1145\/322290.322301"},{"key":"29_CR5","unstructured":"Y. Cochet, Sur l'alg\u00e9bricit\u00e9 des classes de certaines congruences d\u00e9finies sur le monoide libre, Th\u00e8se 3e cycle, Rennes, 1971."},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02771689","volume":"9","author":"Y. Cochet","year":"1971","unstructured":"Y. Cochet and M. Nivat, Une generalization des ensembles de Dyck, Israel J. Math. 9 (1971), 389\u2013395.","journal-title":"Israel J. Math."},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","volume":"16","author":"S. Greibach","year":"1970","unstructured":"S. Greibach, Full AFLs and nested iterated substitution, Info. Control 16 (1970), 7\u201335.","journal-title":"Info. Control"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, J. Assoc. Comput. Mach. 27 (1980), 797\u2013821.","journal-title":"J. Assoc. Comput. Mach."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"M. Jantzen, On a special monoid with a single defining relation, Theoretical Computer Science, to appear.","DOI":"10.1016\/0304-3975(81)90031-1"},{"key":"29_CR10","unstructured":"J. Kr\u00e1l, A modification of substitution theorem and some necessary and sufficient conditions for sets to be context-free, unpublished manuscript."},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"M.H.A. Newman, On theories with a combinatorial definition of \u201cequivalence,\u201d Annals Math. 43 (1942), 223\u2013243.","journal-title":"Annals Math."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"M. Nivat, On some families of languages related to the Dyck languages, 2nd ACM Symp. Theory Computing (1970), 221\u2013225.","DOI":"10.1145\/800161.805168"},{"key":"29_CR13","unstructured":"M. Nivat (wtih M. Benois), Congruences parfaites et quasi-parfaites, Seminaire Dubreil, 25e Ann\u00e9e (1971\u201372), 7-01-09."},{"key":"29_CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1089208.1089210","volume":"13","author":"P. Raulefs","year":"1979","unstructured":"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\u201320.","journal-title":"SIGSAM Bulletin"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B. Rosen","year":"1973","unstructured":"B. Rosen, Tree manipulating systems and Church-Rosser systems, J. Assoc. Comput. Mach. 20 (1973), 160\u2013187.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017317.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:38:14Z","timestamp":1607531894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0017317","relation":{},"subject":[]}}