{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:24Z","timestamp":1761611064561},"reference-count":12,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0020-0190(00)00055-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:00:13Z","timestamp":1027598413000},"page":"221-227","source":"Crossref","is-referenced-by-count":19,"title":["An efficient automata approach to some problems on context-free grammars"],"prefix":"10.1016","volume":"74","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Maler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Willems","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Wolper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00055-7_ID011","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/S0020-0190(00)00055-7_ID012","series-title":"String-Rewriting Systems","author":"Book","year":"1993"},{"key":"10.1016\/S0020-0190(00)00055-7_ID013","series-title":"Proc. INFINITY'96 Workshop","article-title":"Reachability analysis of pushdown automata","author":"Bouajjani","year":"1996"},{"key":"10.1016\/S0020-0190(00)00055-7_ID014","series-title":"Proc. CONCUR'97","first-page":"135","article-title":"Reachability analysis of pushdown automata: Application to model-checking","volume":"Vol. 1243","author":"Bouajjani","year":"1997"},{"key":"10.1016\/S0020-0190(00)00055-7_ID015","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","article-title":"Regular canonical systems and finite automata","volume":"Vol. 6","author":"B\u00fcchi","year":"1964","journal-title":"Arch. Math. Logik Grundl."},{"key":"10.1016\/S0020-0190(00)00055-7_ID016","series-title":"Finite Automata, Their Algebras and Grammars","author":"B\u00fcchi","year":"1988"},{"issue":"1","key":"10.1016\/S0020-0190(00)00055-7_ID017","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","article-title":"On the regular structure of prefix rewriting","volume":"Vol. 106","author":"Caucal","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00055-7_ID018","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"Vol. 3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0020-0190(00)00055-7_ID019","series-title":"Foundations of Computer Science: Potential, Theory, Cognition","first-page":"143","article-title":"An automata approach to some problems on context-free grammars","volume":"Vol. 1337","author":"Esparza","year":"1997"},{"key":"10.1016\/S0020-0190(00)00055-7_ID020","series-title":"Proc. INFINITY'97 Workshop","article-title":"A direct symbolic approach to model-checking pushdown systems","volume":"Vol. 9","author":"Finkel","year":"1997"},{"key":"10.1016\/S0020-0190(00)00055-7_ID021","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0020-0190(00)00055-7_ID022","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","article-title":"Recognition and parsing of context-free languages in time n3","volume":"Vol. 10","author":"Younger","year":"1967","journal-title":"Inform. and Control"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000557?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000557?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:51:30Z","timestamp":1556275890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":12,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0020019000000557"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00055-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}