{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:56:23Z","timestamp":1754556983077},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421214"},{"type":"electronic","value":"9783540451327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45132-3_14","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T12:00:06Z","timestamp":1194955206000},"page":"214-225","source":"Crossref","is-referenced-by-count":41,"title":["On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Freund","sequence":"first","affiliation":[]},{"given":"Gheorghe","family":"P\u0103un","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,9]]},"reference":[{"key":"14_CR1","volume-title":"Computing with Cells and Atoms","author":"C. Calude","year":"2000","unstructured":"C. Calude and Gh. P\u0103un. Computing with Cells and Atoms. Taylor and Francis, London, 2000."},{"key":"14_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"J. Dassow and Gh. P\u0103un. Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, 1989."},{"key":"14_CR3","unstructured":"H. Fernau. Nonterminal complexity of programmed grammars. This volume."},{"key":"14_CR4","unstructured":"R. Freund and Gh. P\u0103un. Computing with Membranes: Three More Collapsing Hierarchies. Submitted, 2000 (also presented at the EMCC Meeting in Milano, Italy, November 3rd, 2000)."},{"key":"14_CR5","unstructured":"M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey, USA."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/00207168408803399","volume":"15","author":"Gh. P\u0103un","year":"1984","unstructured":"Gh. P\u0103un. Six Nonterminals are Enough for Generating Each R.E. Language by a Matrix Grammar. Intern. J. Computer Math.\n                           15 (1984), pp. 23\u201337.","journal-title":"Intern. J. Computer Math."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"1","author":"Gh. P\u0103un","year":"2000","unstructured":"Gh. P\u0103un. Computing with Membranes. Journal of Computer and System Sciences\n                           1, 1 (2000), pp. 108\u2013143.","journal-title":"Journal of Computer and System Sciences"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"14_CR8","unstructured":"G. Rozenberg and A. Salomaa (eds.). Handbook of Formal Languages, 3 volumes. Springer-Verlag, Berlin, 1997."}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45132-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T20:48:07Z","timestamp":1548362887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45132-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421214","9783540451327"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45132-3_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}