{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:35Z","timestamp":1760202515705},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1972,3,1]],"date-time":"1972-03-01T00:00:00Z","timestamp":68256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1972,3]]},"DOI":"10.1007\/bf01706072","type":"journal-article","created":{"date-parts":[[2005,6,21]],"date-time":"2005-06-21T09:20:54Z","timestamp":1119345654000},"page":"37-48","source":"Crossref","is-referenced-by-count":11,"title":["Multi-stack-counter languages"],"prefix":"10.1007","volume":"6","author":[{"given":"Ronald","family":"Book","sequence":"first","affiliation":[]},{"given":"Seymour","family":"Ginsburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01706072_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","volume":"4","author":"R. Book","year":"1970","unstructured":"R. Book andS. Greibach, Quasi-realtime languages,Math. Systems Theory 4 (1970), 97\u2013111.","journal-title":"Math. Systems Theory"},{"key":"BF01706072_CR2","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0019-9958(66)80003-7","volume":"9","author":"P. Fischer","year":"1966","unstructured":"P. Fischer, Turing machines with restricted memory aecess,Information and Control 9 (1966), 364\u2013379.","journal-title":"Information and Control"},{"key":"BF01706072_CR3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","volume":"2","author":"P. Fischer","year":"1968","unstructured":"P. Fischer, A. Meyer andA. Rosenberg, Counter machines and counter languages,Math. Systems Theory 2 (1968), 265\u2013283.","journal-title":"Math. Systems Theory"},{"key":"BF01706072_CR4","first-page":"1","volume":"87","author":"S. Ginsburg","year":"1969","unstructured":"S. Ginsburg andS. Greibach, Abstract families of languages, inStudies in Abstraet Families of Languages, Memoirs Amer. Math. Soc. No. 87, pp. 1\u201332, 1969.","journal-title":"Memoirs Amer. Math. Soc."},{"key":"BF01706072_CR5","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","volume":"4","author":"S. Ginsburg","year":"1970","unstructured":"S. Ginsburg andS. Greibach, Principal AFL,J. Computer System Sciences 4 (1970), 308\u2013338.","journal-title":"J. Computer System Sciences"},{"key":"BF01706072_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"S. Ginsburg, S. Greibach andM. Harrison, One-way stack automata,J. Assoc. Comput. Mach. 14 (1967), 389\u2013418.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01706072_CR7","doi-asserted-by":"crossref","unstructured":"S. Ginsburg, S. Greibach andJ. Hopcroft, Pre-AFL, inStudies in Abstract Families of Languages, Memoirs Amer. Math. Soc. No. 87, pp. 41\u201351, 1969.","DOI":"10.1090\/memo\/0087"},{"key":"BF01706072_CR8","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0019-9958(70)80035-3","volume":"17","author":"S. Ginsburg","year":"1970","unstructured":"S. Ginsburg andM. Harrison, On the closure of AFL under reversal,Information and Control 17 (1970), 395\u2013409.","journal-title":"Information and Control"},{"key":"BF01706072_CR9","unstructured":"S. Ginsburg andG. F. Rose, The equivalence of stack-counter aceeptors and quasirealtime stack-counter acceptors, to appear."},{"key":"BF01706072_CR10","unstructured":"S. Greibach andS. Ginsburg, Multitape AFA,J. Assoc. Comput. Mach., to appear."},{"key":"BF01706072_CR11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0022-0000(69)80015-2","volume":"3","author":"S. Greibach","year":"1969","unstructured":"S. Greibach andJ. Hopcroft, Scattered context grammars,J. Computer System Sciences 3 (1969) 233\u2013247.","journal-title":"J. Computer System Sciences"},{"key":"BF01706072_CR12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"J. Hartmanis andR. Stearns, On the computational eomplexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285\u2013306.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01706072_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"M. Minsky, Recursive unsolvability of Post's problem of \u201cTag\u201d and other topics in the theory of Turing machines,Annals of Math. 74 (1961), 437\u2013455.","journal-title":"Annals of Math."},{"key":"BF01706072_CR14","first-page":"31","volume-title":"Intercalation theorems for stack languages, Symposium on Theory of Computing","author":"W. F. Ogden","year":"1969","unstructured":"W. F. Ogden, Intercalation theorems for stack languages, Symposium on Theory of Computing, Marina del Rey, California, pp. 31\u201342, 1969."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01706072\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T21:42:49Z","timestamp":1586295769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01706072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,3]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1972,3]]}},"alternative-id":["BF01706072"],"URL":"https:\/\/doi.org\/10.1007\/bf01706072","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,3]]}}}