{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T16:40:05Z","timestamp":1772815205296,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":8021,"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":[[1991,8]]},"DOI":"10.1016\/0304-3975(91)90053-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"171-203","source":"Crossref","is-referenced-by-count":35,"title":["QRT FIFO automata, breadth-first grammars and their relations"],"prefix":"10.1016","volume":"85","author":[{"given":"Alessandra","family":"Cherubini","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Citrini","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Crespi Reghizzi","sequence":"additional","affiliation":[]},{"given":"Dino","family":"Mandrioli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90053-5_BIB1","series-title":"Complexity of Computation, 7th SIAM-AMS Proc.","first-page":"75","article-title":"On k-tape versus (k\u22121) tape real-time computation","author":"Aanderaa","year":"1974"},{"key":"10.1016\/0304-3975(91)90053-5_BIB2","first-page":"162","article-title":"Breadth-first phrase-structure grammars and queue automata","volume":"Vol. 324","author":"Allevi","year":"1988"},{"key":"10.1016\/0304-3975(91)90053-5_BIB3","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0022-0000(80)90026-4","article-title":"Multiple equality sets and Post machines","volume":"21","author":"Brandenburg","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90053-5_BIB4","author":"Brandenburg","year":"1985","journal-title":"Counters are not the glb of pushdowns and queues"},{"key":"10.1016\/0304-3975(91)90053-5_BIB5","series-title":"Proc. of 13th ICALP","first-page":"61","article-title":"Intersections of some families of languages","volume":"Vol. 226","author":"Brandenburg","year":"1986"},{"key":"10.1016\/0304-3975(91)90053-5_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(88)90019-9","article-title":"On the intersections of stacks and queues","volume":"58","author":"Brandenburg","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90053-5_BIB7","unstructured":"F.J. Brandenburg, Personal Communication."},{"key":"10.1016\/0304-3975(91)90053-5_BIB8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0022-0000(79)90004-7","article-title":"Reset machines","volume":"19","author":"Book","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90053-5_BIB9","series-title":"Rapp. int. no. 85-11","article-title":"Networks of quasi-real-time automata","author":"Citrini","year":"1985"},{"issue":"3","key":"10.1016\/0304-3975(91)90053-5_BIB10","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1137\/0215049","article-title":"On deterministic multi-pass analysis","volume":"15","author":"Citrini","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90053-5_BIB11","series-title":"Rapp. int. no. 87035","article-title":"QRT FIFO automata","author":"Cherubini","year":"1987"},{"key":"10.1016\/0304-3975(91)90053-5_BIB12","series-title":"Algebraic and Automata Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"issue":"3","key":"10.1016\/0304-3975(91)90053-5_BIB13","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/321281.321294","article-title":"Mappings of languages by two tapes devices","volume":"12","author":"Ginsburg","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90053-5_BIB14","series-title":"Introduction to Formal Languages Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(91)90053-5_BIB15","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"issue":"4","key":"10.1016\/0304-3975(91)90053-5_BIB16","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1145\/321420.321423","article-title":"Real-time definible languages","volume":"14","author":"Rosenberg","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90053-5_BIB17","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(91)90053-5_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(76)90426-5","article-title":"One-way multihead writing finite automata","volume":"30","author":"Sudborough","year":"1976","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90053-5_BIB19","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(80)90047-X","article-title":"Automates \u00e0 file","volume":"11","author":"Vauquelin","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90053-5_BIB20","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF02234250","article-title":"\u00dcber einen Automaten mit Pufferspeicherung","volume":"5","author":"Vollmar","year":"1970","journal-title":"Computing"},{"issue":"2","key":"10.1016\/0304-3975(91)90053-5_BIB21","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/322063.322076","article-title":"k + 1 Heads are better than k","volume":"25","author":"Yao","year":"1978","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900535?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900535?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:35Z","timestamp":1555113275000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591900535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["0304397591900535"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90053-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}