{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T08:05:01Z","timestamp":1790928301735,"version":"4.1.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1968,9,1]],"date-time":"1968-09-01T00:00:00Z","timestamp":-42076800000},"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":[[1968,9]]},"DOI":"10.1007\/bf01694011","type":"journal-article","created":{"date-parts":[[2005,5,15]],"date-time":"2005-05-15T06:08:23Z","timestamp":1116137303000},"page":"265-283","source":"Crossref","is-referenced-by-count":148,"title":["Counter machines and counter languages"],"prefix":"10.1007","volume":"2","author":[{"given":"Patrick C.","family":"Fischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Albert R.","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnold L.","family":"Rosenberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01694011_CR1","unstructured":"A. Cobham, Time and memory capacity bounds for machines which recognize squares or palindromes,IBM Research Report RC-1621, 1966."},{"key":"BF01694011_CR2","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0019-9958(66)80003-7","volume":"9","author":"P. C. Fischer","year":"1966","unstructured":"P. C. Fischer, Turing machines with restricted memory access.Information and Control 9 (1966), 364\u2013379.","journal-title":"Information and Control"},{"key":"BF01694011_CR3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01694010","volume":"2","author":"M. J. Fischer","year":"1968","unstructured":"M. J. Fischer andA. L. Rosenberg, Real-time solutions of the origin-crossing problem.Math. Systems Theory 2 (1968), 257\u2013263.","journal-title":"Math. Systems Theory"},{"key":"BF01694011_CR4","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966."},{"key":"BF01694011_CR5","first-page":"333","volume":"113","author":"S. Ginsburg","year":"1964","unstructured":"S. Ginsburg andE. H. Spanier, BoundedAlgol-like languages,Trans. Amer. Math. Soc. 113 (1964), 333\u2013368.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01694011_CR6","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. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285\u2013306.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01694011_CR7","unstructured":"R. Laing, Realization and complexity of commutative events,Univ. of Mich. Technical Report 03105-48-T, 1967."},{"key":"BF01694011_CR8","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 tag and other topics in the theory of Turing machines,Ann. of Math. 74 (1961), 437\u2013455.","journal-title":"Ann. of Math."},{"key":"BF01694011_CR9","doi-asserted-by":"crossref","unstructured":"A. G. Oettinger, Automatic syntactic analysis and the pushdown store,Proc. 12th Ann. Sympos. in Appl. Math., 1960, pp. 104\u2013129.","DOI":"10.1090\/psapm\/012\/9975"},{"key":"BF01694011_CR10","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. J. Parikh","year":"1966","unstructured":"R. J. Parikh, On context-free languages.J. Assoc. Comput. Mach. 13 (1966), 570\u2013581.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01694011_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","volume":"1","author":"M. O. Rabin","year":"1963","unstructured":"M. O. Rabin, Real-time computation,Israel J. Math. 1 (1963), 203\u2013211.","journal-title":"Israel J. Math."},{"key":"BF01694011_CR12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114\u2013125.","journal-title":"IBM J. Res. Develop."},{"key":"BF01694011_CR13","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1145\/321420.321423","volume":"14","author":"A. L. Rosenberg","year":"1967","unstructured":"A. L. Rosenberg, Real-time definable languages,J. Assoc. Comput. Mach. 14 (1967), 645\u2013662.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01694011_CR14","doi-asserted-by":"crossref","unstructured":"R. E. Stearns, J. Hartmanis andP. Lewis, Hierarchies of memory-limited computation,Proc. 6th Ann. Sympos. Switching Circuit Theory and Logical Design, Ann Arbor, Mich., 1966, pp. 179\u2013190.","DOI":"10.1109\/FOCS.1965.11"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01694011.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01694011\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01694011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T10:09:00Z","timestamp":1586254140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01694011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1968,9]]}},"alternative-id":["BF01694011"],"URL":"https:\/\/doi.org\/10.1007\/bf01694011","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1968,9]]}}}