{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:49:54Z","timestamp":1742399394171},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":7017,"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":[[1994,5]]},"DOI":"10.1016\/0304-3975(94)90104-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"149-170","source":"Crossref","is-referenced-by-count":6,"title":["Cancellation in context-free languages: enrichment by reduction"],"prefix":"10.1016","volume":"127","author":[{"given":"M","family":"Jantzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H","family":"Petersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90104-X_BIB1","first-page":"1188","article-title":"Parties rationelles du groupe libre","volume":"269","author":"Benois","year":"1969","journal-title":"C.R. Acad. Sci. Paris, Ser. A"},{"key":"10.1016\/0304-3975(94)90104-X_BIB2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","article-title":"Monadic Thue systems","volume":"19","author":"Book","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90104-X_BIB3","series-title":"Tech. Report MIP-8904","article-title":"Cancellations in linear context-free languages","author":"Brandenburg","year":"1989"},{"key":"10.1016\/0304-3975(94)90104-X_BIB4","series-title":"Tech. Report MIP-8905","article-title":"Reductions of picture words","author":"Brandenburg","year":"1989"},{"key":"10.1016\/0304-3975(94)90104-X_BIB5","article-title":"Regulated Rewriting in Formal Language Theory","volume":"Vol. 18","author":"Dassow","year":"1989"},{"key":"10.1016\/0304-3975(94)90104-X_BIB6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1112\/plms\/s3-58.1.74","article-title":"Finiteness conditions on subgroups and formal language theory","volume":"58","author":"Frougny","year":"1989","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0304-3975(94)90104-X_BIB7","first-page":"370","article-title":"Grammars with Context Dependency Restricted to Synchronization","volume":"Vol. 233","author":"Geffert","year":"1986"},{"key":"10.1016\/0304-3975(94)90104-X_BIB8","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1051\/ita\/1991250504731","article-title":"Normal forms for phrase-structure grammars","volume":"25","author":"Geffert","year":"1991","journal-title":"RAIRO Theoret. Inform. Appl."},{"key":"10.1016\/0304-3975(94)90104-X_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","article-title":"Full AFLs and nested iterated substitution","volume":"16","author":"Greibach","year":"1970","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(94)90104-X_BIB10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0019-9958(68)90178-2","article-title":"Some remarks on derivations in general rewriting systems","volume":"12","author":"Griffiths","year":"1968","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(94)90104-X_BIB11","series-title":"Project MAC","article-title":"Petri net languages","author":"Hack","year":"1975"},{"key":"10.1016\/0304-3975(94)90104-X_BIB12","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/978-3-540-47919-2_15","article-title":"Language Theory of Petri Nets","volume":"Vol. 254","author":"Jantzen","year":"1987","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(94)90104-X_BIB13","article-title":"Confluent String Rewriting","volume":"Vol. 14","author":"Jantzen","year":"1988"},{"key":"10.1016\/0304-3975(94)90104-X_BIB14","series-title":"Concurrency and Nets","first-page":"245","article-title":"Petri net languages and one-sided Dyck1-reductions of context-free sets","author":"Jantzen","year":"1987"},{"key":"10.1016\/0304-3975(94)90104-X_BIB15","first-page":"3","article-title":"Dyck1-reductions of context-free languages","volume":"9","author":"Jantzen","year":"1990","journal-title":"Comput. Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)90104-X_BIB16","first-page":"228","article-title":"Twisting Petri net languages and how to obtain them by reducing linear context-free sets","author":"Jantzen","year":"1991","journal-title":"Proc. 12th Internat. Conf. on Petri Nets"},{"key":"10.1016\/0304-3975(94)90104-X_BIB17","series-title":"Dissertation","article-title":"On insertion and deletion in formal languages","author":"Kari","year":"1991"},{"key":"10.1016\/0304-3975(94)90104-X_BIB18","article-title":"Formal description of communication behaviour","author":"Kimura","year":"1979","journal-title":"Proc. Johns Hopkins Conf. on Information Sciences and Systems"},{"key":"10.1016\/0304-3975(94)90104-X_BIB19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/322358.322365","article-title":"A supernormal-form theorem for context-free grammars","volume":"30","author":"Maurer","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90104-X_BIB20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","article-title":"Using string languages to describe picture languages","volume":"54","author":"Maurer","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(94)90104-X_BIB21","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0304-3975(94)90104-X_BIB22","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1137\/0202014","article-title":"How to make arbitrary grammars look like context-free grammars","volume":"2","author":"Savitch","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90104-X_BIB23","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0019-9958(75)90066-2","article-title":"Some characterizations of Lindenmayer systems in terms of Chomsky-type grammars and stack machines","volume":"27","author":"Savitch","year":"1975","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(94)90104-X_BIB24","series-title":"The Book of L","first-page":"403","article-title":"Parenthesis grammars and Lindenmayer systems","author":"Savitch","year":"1986"},{"key":"10.1016\/0304-3975(94)90104-X_BIB25","first-page":"1","article-title":"Formal languages and power series","author":"Stanat","year":"1971","journal-title":"Proc. 3rd ACM Symp. Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490104X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:04Z","timestamp":1555129624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759490104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["030439759490104X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90104-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}