{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:31Z","timestamp":1725663271851},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_157","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:24:53Z","timestamp":1330187093000},"page":"365-373","source":"Crossref","is-referenced-by-count":2,"title":["Two decidability results for deterministic pushdown automata"],"prefix":"10.1007","author":[{"given":"Matti","family":"Linna","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(76)90074-8","volume":"1","author":"E. P. Friedman","year":"1976","unstructured":"Friedman, E. P., The inclusion problem for simple languages, Theoret. Comput. Sci. 1 (1976) 297\u2013316.","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","volume":"7","author":"M. A. Harrison","year":"1973","unstructured":"Harrison, M. A. and Havel, I. M., Strict deterministic grammars, J. Comput. System. Sci. 7 (1973) 237\u2013277.","journal-title":"J. Comput. System. Sci."},{"key":"35_CR3","first-page":"89","volume":"2","author":"V. A. Jaffe","year":"1974","unstructured":"Jaffe, V. A., Two classes of CF-languages with a solvable equivalence problem, Kibernetika, Kiev, 2 (1974) 89\u201393.","journal-title":"Kibernetika, Kiev"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Korenjak, A. J. and Hopcroft, J. E., Simple deterministic languages, IEEE Conf. Record of 7th Annual Symp. on Switching and Automata Theory (1966) 36\u201346.","DOI":"10.1109\/SWAT.1966.22"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0019-9958(76)90341-7","volume":"30","author":"H. P. Kriegel","year":"1976","unstructured":"Kriegel, H. P. and Maurer, H. A., Formal translations and Szilard languages, Information and Control 30 (1976) 187\u2013198.","journal-title":"Information and Control"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Kriegel, H. P. and Ottmann, Th., Left-fitting translations, manuscript (1976).","DOI":"10.1007\/3-540-08342-1_24"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0019-9958(73)90237-4","volume":"22","author":"E. Moriya","year":"1973","unstructured":"Moriya, E., The associate language and the derivation properties of formal grammars, Information and Control 22 (1973) 139\u2013162.","journal-title":"Information and Control"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF00288639","volume":"3","author":"M. Penttonen","year":"1974","unstructured":"Penttonen, M., On derivation languages corresponding to context-free grammars, Acta Informatica 3 (1974) 285\u2013291.","journal-title":"Acta Informatica"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"D. J. Rosenkranz","year":"1970","unstructured":"Rosenkranz, D. J. and Stearns, R. E., Properties of deterministic top-down grammars, Information and Control 17 (1970) 226\u2013255.","journal-title":"Information and Control"},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/S0022-0000(76)80049-9","volume":"13","author":"K. Taniguchi","year":"1976","unstructured":"Taniguchi, K. and Kasami, T., A result on the equivalence problem for deterministic pushdown automata, J. Comput. System. Sci. 13 (1976) 38\u201350.","journal-title":"J. Comput. System. Sci."},{"key":"35_CR11","unstructured":"Valiant, L. G., Decision problems for families of deterministic pushdown automata, Univ. of Warwick Computer Centre, Report No.7, 1973."},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","volume":"25","author":"L. G. Valiant","year":"1974","unstructured":"Valiant, L. G., The equivalence problem for deterministic finite-turn pushdown automata, Information and Control 25 (1974) 123\u2013133.","journal-title":"Information and Control"},{"key":"35_CR13","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","volume":"10","author":"L. G. Valiant","year":"1975","unstructured":"Valiant, L. G. and Paterson, M. S., Deterministic one-counter automata, J. Comput. System. Sci. 10 (1975) 340\u2013350.","journal-title":"J. Comput. System. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_157.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:22Z","timestamp":1605643162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_157","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}