{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:35Z","timestamp":1771024235234,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/bf00289076","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T12:49:04Z","timestamp":1096894144000},"page":"171-181","source":"Crossref","is-referenced-by-count":13,"title":["On the complexity of formal grammars"],"prefix":"10.1007","volume":"9","author":[{"given":"Ronald V.","family":"Book","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Book, R.: Grammars with time functions. Harvard University, Ph.D. Dissertation, 1969. Also appears as Mathematical Linguistics and Automatic Translation, NSF-23, Aiken Computation Laboratory, Harvard University, Cambridge, MA, 1969"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0022-0000(71)80025-9","volume":"5","author":"R. Book","year":"1971","unstructured":"Book, R.: Time-bounded grammars and their languages. J. Comput. System Sci. 5, 397?429 (1971)","journal-title":"J. Comput. System Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00976059","volume":"2","author":"R. Book","year":"1973","unstructured":"Book, R.: On the structure of context-sensitive grammars. Internat. J. Comput. Information Sci. 2, 129?139 (1973)","journal-title":"Internat. J. Comput. Information Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(74)80008-5","volume":"9","author":"R. Book","year":"1974","unstructured":"Book, R.: Comparing complexity classes. J. Comput. System Sci. 9, 213?229 (1974)","journal-title":"J. Comput. System Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(76)90057-8","volume":"1","author":"R. Book","year":"1975","unstructured":"Book, R.: Translational lemmas, polynomial time, and (log n) j -space. Theor. Comput. Sci. 1, 215?226 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem-proving procedures. In: Proc. Third ACM Symposium on Theory of Computing, 1971, pp. 151?158","DOI":"10.1145\/800157.805047"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Fischer, M.: Grammars with macro-like productions. In: Conference Record Ninth IEEE Symp. Switching and Automata Theory, 1968, pp. 131?142","DOI":"10.1109\/SWAT.1968.12"},{"key":"CR8","first-page":"29","volume":"3","author":"A. Gladkii","year":"1964","unstructured":"Gladkii, A.: On the complexity of derivations in phrase-structure grammars [in Russian]. Algebrai i Logika Sem. 3, 29?44 (1964)","journal-title":"Algebrai i Logika Sem."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","volume":"3","author":"S. Greibach","year":"1969","unstructured":"Greibach, S.: Checking automata and one-way stack languages. J. Comput. System Sci. 3, 196?217 (1969)","journal-title":"J. Comput. System Sci."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00978977","volume":"3","author":"S. Greibach","year":"1974","unstructured":"Greibach, S.: Some restrictions on W-grammars. Internat J. Comput. Information Sci. 3, 289?327 (1974)","journal-title":"Internat J. Comput. Information Sci."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF00264470","volume":"8","author":"Y. Igarashi","year":"1977","unstructured":"Igarashi, Y.: General properties of derivational complexity. Acta Informat. 8, 267?283 (1977)","journal-title":"Acta Informat."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0022-0000(73)80044-3","volume":"7","author":"Y. Igarashi","year":"1973","unstructured":"Igarashi, Y., Honda, N.: On the extension of Gladkii's theorem and the hierarchies of languages. J. Comput. System Sci 7, 199?217 (1973)","journal-title":"J. Comput. System Sci"},{"key":"CR13","volume-title":"Complexity of computer computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibilities among combinatorial problems. In: Complexity of computer computations (R. Miller, J. Thatcher, eds.). New York: Plenum Press 1972"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S.-Y. Kuroda","year":"1964","unstructured":"Kuroda, S.-Y.: Classes of languages and linear-bounded automata. Information and Control 7, 207?223 (1964)","journal-title":"Information and Control"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0019-9958(63)90169-4","volume":"6","author":"P. Landweber","year":"1963","unstructured":"Landweber, P.: Three theorems on phrase-structure grammars. Information and Control 6, 131?136 (1963)","journal-title":"Information and Control"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Rounds, W.: Complexity of recognition in intermediate-level languages. In: Conf. Record Fourteenth IEEE Symp. Switching and Automata Theory, 1973, pp. 145?158","DOI":"10.1109\/SWAT.1973.5"},{"key":"CR17","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal languages. New York-London: Academic Press 1973"},{"key":"CR18","first-page":"27","volume-title":"Lecture notes in computer science, Vol. 14","author":"E. Shamir","year":"1974","unstructured":"Shamir, E., Beeri, C.: Checking stacks and context-free programmed grammars accept p-complete languages. In: Proc. 2nd Colloquium on Automata Languages, and Programming. Lecture notes in computer science, Vol. 14, pp. 27?33. Berlin-Heidelberg-New York: Springer 1974"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0020-0190(75)90027-7","volume":"3","author":"J. Leeuwen van","year":"1975","unstructured":"van Leeuwen, J.: The membership question for ETOL-languages is polynomially complete. Information Processing Lett. 3, 138?143 (1975)","journal-title":"Information Processing Lett."},{"key":"CR20","first-page":"61","volume-title":"International Computing Symposium 1975","author":"J. Leeuwen van","year":"1975","unstructured":"van Leeuwen, J..: Extremal properties of non-deterministic time-complexity classes. In: International Computing Symposium 1975 (E. Gelenbe, D. Potier, eds.), pp. 61?64. Amsterdam: North Holland 1975"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:38Z","timestamp":1554743678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["BF00289076"],"URL":"https:\/\/doi.org\/10.1007\/bf00289076","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}