{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:24:29Z","timestamp":1648675469175},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1995,6]]},"abstract":"<jats:p> In this paper we consider pushdown automata on infinite trees with empty stack as the accepting condition (\u03c9-EPDTA). We provide the following regarding \u03c9-EPDTA: (a) its relationship to other Pushdown automata on infinite trees, (b) a Kleene-Closure theorem and (c) a single exponential time algorithm for checking emptiness. We demonstrate the usefulness of \u03c9-EPDTA through two example applications: defining the temporal uniform inevitability property and specifying a context-free process with unbounded state space, both of which cannot be defined and\/or specified by the classical finite state automata on infinite trees. We also discuss the relevance of the results presented here to model-checking. <\/jats:p>","DOI":"10.1142\/s0129054195000123","type":"journal-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T06:59:25Z","timestamp":1100242765000},"page":"169-186","source":"Crossref","is-referenced-by-count":3,"title":["A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES"],"prefix":"10.1142","volume":"06","author":[{"given":"WUXU","family":"PENG","sequence":"first","affiliation":[{"name":"Department of Computer Science, Southwest Texas State University, San Marcos, Texas 78666, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. PURUSHOTHAMAN","family":"IYER","sequence":"additional","affiliation":[{"name":"Department of Computer Science, North Carolina State University, Raleigh, North Carolina 27695, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054195000123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:44:31Z","timestamp":1565124271000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054195000123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1995,6]]}},"alternative-id":["10.1142\/S0129054195000123"],"URL":"https:\/\/doi.org\/10.1142\/s0129054195000123","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}