{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:22:56Z","timestamp":1781893376461,"version":"3.54.5"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005079","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-12","source":"Crossref","is-referenced-by-count":4,"title":["Regular separability of one counter automata"],"prefix":"10.1109","author":[{"given":"Wojciech","family":"Czerwinski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Slawomir","family":"Lasota","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"173","article-title":"A note on decidable separability by piecewise testable languages","author":"czerwi?ski","year":"2015","journal-title":"Proc FCT'15"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934552"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.12.004"},{"key":"ref13","first-page":"97:1","article-title":"Deciding piecewise testable separability for regular tree languages","author":"goubault-larrecq","year":"2016","journal-title":"Proc ICALP’16"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322317"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_54"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933579"},{"key":"ref17","first-page":"80","article-title":"Parikh images of grammars: Complexity and applications","author":"kopczy?ski","year":"2010","journal-title":"Proc LICS'10"},{"key":"ref18","first-page":"363","article-title":"Separating regular languages by locally testable and locally threshold testable languages","author":"place","year":"2013","journal-title":"Proc FSTTCS'13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_64"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.14"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934561"},{"key":"ref6","first-page":"128:1","article-title":"The taming of the semi-linear set","author":"chistikov","year":"2016","journal-title":"Proceedings 16 ICALP"},{"key":"ref5","first-page":"103","article-title":"On the expressiveness of Parikh automata and related models","author":"cadilhac","year":"2011","journal-title":"Proc NCMA’ 11"},{"key":"ref8","first-page":"24:1","article-title":"Separability of reachability sets of vector addition systems","author":"clemente","year":"2017","journal-title":"Proc STACS'17"},{"key":"ref7","article-title":"Regular separability of Parikh automata","author":"clemente","year":"2017","journal-title":"Proc ICALP’ 17"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934561"},{"key":"ref9","first-page":"150","article-title":"Efficient separability of regular languages by subsequences and suffixes","author":"czerwi?ski","year":"2013","journal-title":"Proc ICALP'13"},{"key":"ref1","first-page":"531","article-title":"Some algorithmic problems for pseudovarieties","volume":"54","author":"almeida","year":"1999","journal-title":"Publ Math Debrecen"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_29"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15349-5_4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-12(1:5)2016"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0205019"},{"key":"ref23","article-title":"Introduction to the theory of computation","author":"sipser","year":"2013","journal-title":"Cengage Learning"},{"key":"ref26","author":"worrell","year":"2016","journal-title":"Personal communication"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90067-2"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005079.pdf?arnumber=8005079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T22:30:37Z","timestamp":1506983437000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005079\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005079","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}