{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:35:32Z","timestamp":1649064932895},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1093\/comjnl\/bxx036","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T03:36:25Z","timestamp":1490931385000},"page":"63-73","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic Deep Pushdown Transducer and its Parallel Version"],"prefix":"10.1093","volume":"61","author":[{"given":"Nidhi","family":"Kalra","sequence":"first","affiliation":[]},{"given":"Ajay","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2017,4,21]]},"reference":[{"key":"key\n\t\t\t\t20180119051320_bxx036C1","year":"2013"},{"key":"key\n\t\t\t\t20180119051320_bxx036C2","volume-title":"The Theory of Parsing, Translation, and Compiling","year":"1972"},{"key":"key\n\t\t\t\t20180119051320_bxx036C3","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00236-006-0005-0","article-title":"Deep pushdown automata","volume":"42","year":"2006","journal-title":"Acta Inf."},{"key":"key\n\t\t\t\t20180119051320_bxx036C4","year":"2012"},{"key":"key\n\t\t\t\t20180119051320_bxx036C5","volume-title":"Regulated Rewriting in Formal Language Theory","year":"1989","edition":"1st edn"},{"key":"key\n\t\t\t\t20180119051320_bxx036C6","volume-title":"Formal Languages and Applications, Studies in Fuzziness and Soft Computing","year":"2004","edition":"1st ed"},{"key":"key\n\t\t\t\t20180119051320_bxx036C7","volume-title":"Regulated Grammars and Automata","year":"2014","edition":"1st edn"},{"key":"key\n\t\t\t\t20180119051320_bxx036C8","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/S0022-0000(70)80045-9","article-title":"An hierarchy between context-free and context-sensitive languages","volume":"4","year":"1970","journal-title":"J. Comput. Syst. Sci."},{"key":"key\n\t\t\t\t20180119051320_bxx036C9","year":"2014"},{"key":"key\n\t\t\t\t20180119051320_bxx036C10","volume-title":"Introduction to Languages and the Theory of Computation","year":"1991"},{"key":"key\n\t\t\t\t20180119051320_bxx036C11","year":"2014"},{"key":"key\n\t\t\t\t20180119051320_bxx036C12","year":"2015"},{"key":"key\n\t\t\t\t20180119051320_bxx036C13","doi-asserted-by":"crossref","first-page":"249","DOI":"10.3233\/IFS-162138","article-title":"Fuzzy state grammar and fuzzy deep pushdown automaton","volume":"31","year":"2016","journal-title":"J. Intell. Fuzzy Syst."},{"key":"key\n\t\t\t\t20180119051320_bxx036C14","doi-asserted-by":"crossref","first-page":"470","DOI":"10.2174\/1574893611666151231185112","article-title":"State grammar and deep pushdown automata for biological sequences of nucleic acids","volume":"11","year":"2016","journal-title":"Curr. Bioinform."},{"key":"key\n\t\t\t\t20180119051320_bxx036C15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01692513","article-title":"Control sets on grammars","volume":"2","year":"1968","journal-title":"Math. Syst. Theory"},{"key":"key\n\t\t\t\t20180119051320_bxx036C16","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(73)90917-0","article-title":"On matrix languages","volume":"23","year":"1973","journal-title":"Inf. Control"},{"key":"key\n\t\t\t\t20180119051320_bxx036C17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00236-011-0134-y","article-title":"One-sided random context grammars","volume":"48","year":"2011","journal-title":"Acta Inf."},{"key":"key\n\t\t\t\t20180119051320_bxx036C18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.tcs.2013.11.009","article-title":"One-sided random context grammars with a limited number of right random context rules","volume":"516","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"key\n\t\t\t\t20180119051320_bxx036C19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1080\/00207169008803908","article-title":"Generalized forbidding grammars","volume":"36","year":"1990","journal-title":"Int. J. Comput. Math."},{"key":"key\n\t\t\t\t20180119051320_bxx036C20","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1080\/00207160.2012.723703","article-title":"Generalized one-sided forbidding grammars","volume":"90","year":"2013","journal-title":"Int. J. Comput. Math."},{"key":"key\n\t\t\t\t20180119051320_bxx036C21","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1080\/00207160.2011.642300","article-title":"One-sided forbidding grammars and selective substitution grammars","volume":"89","year":"2012","journal-title":"Int. J. Comput. Math."},{"key":"key\n\t\t\t\t20180119051320_bxx036C22","year":"1983"},{"key":"key\n\t\t\t\t20180119051320_bxx036C23","first-page":"75","volume-title":"Trends Techniques and Problems in Theoretical Computer Science, Lecture Notes in Computer Science","year":"1987"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/1\/63\/23571937\/bxx036.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T06:22:30Z","timestamp":1516342950000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/61\/1\/63\/3746508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,21]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,4,21]]},"published-print":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxx036","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,1]]},"published":{"date-parts":[[2017,4,21]]}}}