{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:02:28Z","timestamp":1649210548939},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p> Recently, it has been shown that for any higher order pushdown system [Formula: see text] and for any regular set [Formula: see text] of configurations, the set [Formula: see text], is regular. In this paper, we give an alternative proof of this result for second order automata. Our construction of automaton for recognizing [Formula: see text] is explicit. The termination of saturation procedure used is obvious. It gives EXPTIME bound on size of the automaton recognizing [Formula: see text] if there is no alternation present in [Formula: see text] and in the automaton recognizing [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s012905410800608x","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T10:30:40Z","timestamp":1218018640000},"page":"983-998","source":"Crossref","is-referenced-by-count":3,"title":["AN ALTERNATIVE CONSTRUCTION IN SYMBOLIC REACHABILITY ANALYSIS OF SECOND ORDER PUSHDOWN SYSTEMS"],"prefix":"10.1142","volume":"19","author":[{"given":"ANIL","family":"SETH","sequence":"first","affiliation":[{"name":"CSE Department, I.I.T. Kanpur, Kanpur 208016, India"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"p_1","first-page":"135","author":"Bouajjani A.","year":"1997","journal-title":"Proc. Concur"},{"key":"p_2","first-page":"3328","author":"Bouajjani A.","year":"2004","journal-title":"Proc. FSTTCS"},{"key":"p_3","first-page":"213","author":"Hague M.","year":"2007","journal-title":"Proc. FoSSaCS"},{"key":"p_6","first-page":"315","author":"Cachat T.","year":"2003","journal-title":"Proc. ICALP"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410800608X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:24:06Z","timestamp":1565191446000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410800608X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":4,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1142\/S012905410800608X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410800608x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}