iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1145/321541.321544
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:19:15Z","timestamp":1672550355218},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1969,10]]},"abstract":"It is shown that every two-way (deterministic) stack automaton language is accepted by a two-way (deterministic) stack automaton which for each input has a bound on the length of a valid computation. As a consequence, two-way deterministic stack languages are closed under complementation.<\/jats:p>","DOI":"10.1145\/321541.321544","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:10Z","timestamp":1027769170000},"page":"550-563","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Halting Stack Automata"],"prefix":"10.1145","volume":"16","author":[{"given":"J. D.","family":"Ullman","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Princeton University, Princeton, N.J. and Bell Telephone Laboratories, Inc., Murray Hill, New Jersey"}]}],"member":"320","published-online":{"date-parts":[[1969,10]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/321371.321385"},{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0022-0000(67)80013-8","volume":"1","author":"HOPCROFT J. E.","year":"1967","journal-title":"J. Comput. Syst. Sci."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321403"},{"key":"e_1_2_1_4_2","first-page":"2","volume":"15","author":"HOPCROFT J. E.","year":"1968","journal-title":"InJorm. Contr."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(68)80003-0","volume":"2","author":"HOPCROFT J. E.","year":"1968","journal-title":"J. Comput. Syst. Sci."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(67)90369-5","volume":"11","author":"GRAY J. N.","year":"1967","journal-title":"Inform. Contr."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/321495.321508"},{"key":"e_1_2_1_8_2","unstructured":"GINSnUR S. AND HOPCROFT J. E. Two-way balloon automata and AFL. Rep. TM 738\/042\/00 System Development Corp. Santa Monica Calif. GINSnUR S. AND HOPCROFT J. E. Two-way balloon automata and AFL. Rep. TM 738\/042\/00 System Development Corp. Santa Monica Calif."},{"key":"e_1_2_1_9_2","volume-title":"Mass.","author":"HOPCROFT Z. E.","year":"1969"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/321541.321544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T20:10:16Z","timestamp":1672517416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/321541.321544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,10]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1969,10]]}},"alternative-id":["10.1145\/321541.321544"],"URL":"http:\/\/dx.doi.org\/10.1145\/321541.321544","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1969,10]]},"assertion":[{"value":"1969-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}