{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:08:31Z","timestamp":1776942511470,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"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":13468,"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":[[1976,9]]},"DOI":"10.1016\/0304-3975(76)90081-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"271-294","source":"Crossref","is-referenced-by-count":31,"title":["Finite automata with multiplication"],"prefix":"10.1016","volume":"2","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[]},{"given":"Sartaj K.","family":"Sahni","sequence":"additional","affiliation":[]},{"given":"Chul E.","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90081-5_BIB1","series-title":"On finding non-negative integer solutions to sets of linear equations","author":"Baker","year":"1974"},{"key":"10.1016\/0304-3975(76)90081-5_BIB2","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","article-title":"Deterministic context-free languages","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90081-5_BIB3","series-title":"Studies In Abstract Families of Languages","first-page":"1","article-title":"Abstract families of languages","volume":"87","author":"Ginsburg","year":"1969"},{"key":"10.1016\/0304-3975(76)90081-5_BIB4","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way stack automata","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90081-5_BIB5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0019-9958(70)80035-3","article-title":"On the closure of AFL under reversal","volume":"17","author":"Ginsburg","year":"1970","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90081-5_BIB6","first-page":"333","article-title":"Bounded ALGOL-like languages","volume":"113","author":"Ginsburg","year":"1964","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/0304-3975(76)90081-5_BIB7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","article-title":"Multi-tape and multi-head pushdown automata","volume":"13","author":"Harrison","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90081-5_BIB8","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(76)90081-5_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","article-title":"A note on semilinear sets and bounded-reversal multihead pushdown automata","volume":"3","author":"Ibarra","year":"1974","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(76)90081-5_BIB10","series-title":"Technical Report 74-7","article-title":"Finite automata with multiplication","author":"Ibarra","year":"1974"},{"key":"10.1016\/0304-3975(76)90081-5_BIB11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90081-5_BIB12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u201cTag\u201d and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Annals of Math"},{"key":"10.1016\/0304-3975(76)90081-5_BIB13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(76)90081-5_BIB14","series-title":"Ph.D. Thesis","article-title":"Nonwriting extensions of finite automata","author":"Rosenberg","year":"1965"},{"key":"10.1016\/0304-3975(76)90081-5_BIB15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0019-9958(74)90994-2","article-title":"Bounded-reversal multi-head finite automata languages","volume":"25","author":"Sudborough","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90081-5_BIB16","unstructured":"I.H. Sudborough, Personal Communication."},{"key":"10.1016\/0304-3975(76)90081-5_BIB17","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0020-0255(74)90006-1","article-title":"Note on analogue memory automata","volume":"7","author":"Tamura","year":"1974","journal-title":"Information Sci."},{"key":"10.1016\/0304-3975(76)90081-5_BIB18","first-page":"230","article-title":"On computable numbers with an application to the Entscheidungs problem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0304-3975(76)90081-5_BIB19","first-page":"303","article-title":"A partial solution to the reachability problem for vector addition systems","author":"Van Leeuwen","year":"1974","journal-title":"Stochastics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900815?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900815?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:21:22Z","timestamp":1555111282000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,9]]}},"alternative-id":["0304397576900815"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90081-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}