{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:53Z","timestamp":1720201133416},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90127-6","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"3-13","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Context-free grammars with cancellation properties"],"prefix":"10.1016","volume":"39","author":[{"given":"Christiane","family":"Frougny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90127-6_BIB1_1","article-title":"Defining relations and algorithmic problems for groups and semigroups","volume":"85","author":"Adjan","year":"1966"},{"key":"10.1016\/0304-3975(85)90127-6_BIB1_2","article-title":"Defining relations and algorithmic problems for groups and semigroups","volume":"152","author":"Adjan","year":"1967","journal-title":"Amer. Math. Soc. Transl."},{"key":"10.1016\/0304-3975(85)90127-6_BIB2","first-page":"695","article-title":"Zur algebraischen Charakteristik der durch kontextfreie Sprachen definierten Gruppen","volume":"11","author":"Anisimov","year":"1975","journal-title":"EIK"},{"key":"10.1016\/0304-3975(85)90127-6_BIB3","article-title":"Une note sur le th\u00e9or\u00e8me de caract\u00e9risation des g\u00e9n\u00e9rateurs alg\u00e9briques","author":"Beauquier","year":"1983","journal-title":"Rapport L.I.T.P. 83-22"},{"key":"10.1016\/0304-3975(85)90127-6_BIB4","series-title":"Congruences plus que parfaites et langages alg\u00e9briques","author":"Berstel","year":"1977"},{"key":"10.1016\/0304-3975(85)90127-6_BIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1051\/ita\/1979130100691","article-title":"Langages tr\u00e8s simples g\u00e9n\u00e9rateurs","volume":"13","author":"Frougny","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(85)90127-6_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00625283","article-title":"On the Hotz group of a context-free grammar","volume":"18","author":"Frougny","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(85)90127-6_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(67)80003-5","article-title":"Bracketed context-free languages","volume":"1","author":"Ginsburg","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90127-6_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(75)80042-0","article-title":"One-counter languages and the IRS condition","volume":"10","author":"Greibach","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90127-6_BIB9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(80)90040-7","article-title":"Eine neue Invariante f\u00fcr kontextfreie Sprachen","volume":"11","author":"Hotz","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90127-6_BIB10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1051\/ita\/1979130403371","article-title":"\u00dcber die Darstellbarkeit des syntaktischen Monoides kontextfreier Sprachen","volume":"13","author":"Hotz","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(85)90127-6_BIB11","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/0304-3975(85)90127-6_BIB12","series-title":"Proc. 13th Symp. on Theory of Computing","first-page":"46","article-title":"Pushdown automata, graphs, ends, second-order logic, and reachability problems","author":"Muller","year":"1981"},{"key":"10.1016\/0304-3975(85)90127-6_BIB13","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/321406.321412","article-title":"Matrix equations and normal forms for context-free grammars","volume":"14","author":"Rosenkrantz","year":"1967","journal-title":"ACM"},{"key":"10.1016\/0304-3975(85)90127-6_BIB14","series-title":"S\u00e9minaire Dubreil 1975\u20131976","first-page":"168","article-title":"Sur les groupes infinis, consid\u00e9r\u00e9s comme monoides syntaxiques de langages formels","volume":"586","author":"Sakarovitch","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:58Z","timestamp":1553158378000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":15,"alternative-id":["0304397585901276"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90127-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}