{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:48Z","timestamp":1750219788087,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM SIGLOG News"],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:p>In this issue's Automata Theory Column, we have an article by Andreas Pavlogiannis on the CFL\/Dyck reachability problem on graphs:<\/jats:p>\n          <jats:p>\n            Given a graph\n            <jats:italic>G<\/jats:italic>\n            with edges labeled by symbols from an alphabet \u03a3, source and target nodes\n            <jats:italic>s<\/jats:italic>\n            and\n            <jats:italic>t<\/jats:italic>\n            , respectively, and a context-free language\n            <jats:italic>L<\/jats:italic>\n            over \u03a3, determine if there is a path from\n            <jats:italic>s<\/jats:italic>\n            to\n            <jats:italic>t<\/jats:italic>\n            that is labeled by a word in\n            <jats:italic>L.<\/jats:italic>\n          <\/jats:p>","DOI":"10.1145\/3583660.3583663","type":"journal-article","created":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:06:21Z","timestamp":1675703181000},"page":"4-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Automata Column"],"prefix":"10.1145","volume":"9","author":[{"given":"Mahesh","family":"Viswanathan","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,6]]},"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583660.3583663","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:54Z","timestamp":1750178274000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583660.3583663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10.1145\/3583660.3583663"],"URL":"https:\/\/doi.org\/10.1145\/3583660.3583663","relation":{},"ISSN":["2372-3491"],"issn-type":[{"type":"electronic","value":"2372-3491"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"2023-02-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}