{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:17Z","timestamp":1759626617562,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4215,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(00)00417-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:05:14Z","timestamp":1027577114000},"page":"463-491","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Associative language descriptions"],"prefix":"10.1016","volume":"270","author":[{"given":"Alessandra","family":"Cherubini","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Crespi Reghizzi","sequence":"additional","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00417-5_BIB1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01131538","article-title":"Entwurf einer neurologischen Theorie der Sprache","volume":"79","author":"Braitenberg","year":"1992","journal-title":"Naturwissenschaften"},{"key":"10.1016\/S0304-3975(00)00417-5_BIB2","unstructured":"A. Cherubini, S. Crespi Reghizzi, P. San Pietro, Languages based on structural local testability, in: C.S. Calude, M.J. Dinnen (Eds.), Combinatorics, Computation and Logic, Proc. DMTCS99, Auckland, New Zealand, Springer, Berlin, 18\u201321 January 1999, pp. 159\u2013174."},{"key":"10.1016\/S0304-3975(00)00417-5_BIB3","unstructured":"S. Crespi Reghizzi, V. Braitenberg, Towards a brain compatible theory of syntax based on local testability, in: C. Martin-Vide, V. Mitrana (Eds.), Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, Gordan and Breach, London, 2001."},{"issue":"4","key":"10.1016\/S0304-3975(00)00417-5_BIB4","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1145\/322092.322098","article-title":"Non-counting context-free languages","volume":"25","author":"Crespi Reghizzi","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00417-5_BIB5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1137\/0210013","article-title":"Operators precedence grammars and the non-counting property","volume":"10","author":"Crespi Reghizzi","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00417-5_BIB6","unstructured":"S. Crispi Reghizzi, M. Pradella, P. San Pietro, Associative definition of programming languages, Computer Languages, to appear."},{"key":"10.1016\/S0304-3975(00)00417-5_BIB7","first-page":"237","article-title":"Contextual grammars and formal languages","volume":"vol. II","author":"Ehrenfeucht","year":"1997"},{"key":"10.1016\/S0304-3975(00)00417-5_BIB8","doi-asserted-by":"crossref","unstructured":"F. Gcseg, M. Steinby, Tree languages, Handbook of Formal Languages, in: G. Rozenberg, A. Saloma (Eds.), vol. III, Springer, Berlin, 1997, pp. 1\u201361 (Chapter 1).","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"10.1016\/S0304-3975(00)00417-5_BIB9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","article-title":"An infinite iierarchy of context-free languages","volume":"16","author":"Greibach","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00417-5_BIB10","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"SIAM J. Comput."},{"year":"1978","series-title":"Introduction to Formal Language Theory","author":"Harrison","key":"10.1016\/S0304-3975(00)00417-5_BIB11"},{"year":"1979","series-title":"Introduction to Automata Theory, Formal Languages and Computation","author":"Hopcroft","key":"10.1016\/S0304-3975(00)00417-5_BIB12"},{"issue":"10","key":"10.1016\/S0304-3975(00)00417-5_BIB13","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","article-title":"Tree adjunct grammars","volume":"10","author":"Joshi","year":"1975","journal-title":"J. Comput, System Sci."},{"key":"10.1016\/S0304-3975(00)00417-5_BIB14","doi-asserted-by":"crossref","unstructured":"S. Marcus, Contextual grammars and natural languages, in: G. Rozenberg, A. Saloma (Eds.), Handbook of Formal Languages, vol. II, Springer, Berlin, 1997, pp. 215\u2013132 (Chapter 6).","DOI":"10.1007\/978-3-662-07675-0_5"},{"year":"1971","series-title":"Counter-Free Automata","author":"McNaughton","key":"10.1016\/S0304-3975(00)00417-5_BIB15"},{"issue":"76","key":"10.1016\/S0304-3975(00)00417-5_BIB16","first-page":"63","article-title":"On semicontextual grammars","volume":"28","author":"P\u00e4un","year":"1984","journal-title":"Bull. Math Soc. Sci. Math. Roumanie"},{"key":"10.1016\/S0304-3975(00)00417-5_BIB17","unstructured":"G.E. R\u00e9v\u00e9sz, Introduction to Formal Languages, Dover Publ. New York, 1991."},{"key":"10.1016\/S0304-3975(00)00417-5_BIB18","unstructured":"W. Thomas, On noncounting tree languages, Grundl. Theor. Informatik, Proc. 1 Internat Workshop, Paderborn, 1982, pp. 234\u2013242."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:08Z","timestamp":1759625528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397500004175"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00417-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Associative language descriptions","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00417-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}