{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:57Z","timestamp":1753889877110,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Automata, Logic and Semantics","license":[{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter automaton and one-way deterministic one-counter automaton.   We also obtain new results on classical counter automata regarding language recognition. It was conjectured that one-way probabilistic one blind-counter automata cannot recognize Kleene closure of equality language [A. Yakaryilmaz: Superiority of one-way and realtime quantum machines. RAIRO - Theor. Inf. and Applic. 46(4): 615-641 (2012)]. We show that this conjecture is false, and also show several separation results for blind\/non-blind counter automata.<\/jats:p><jats:p>Comment: 21 pages<\/jats:p>","DOI":"10.23638\/dmtcs-21-4-12","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:39:16Z","timestamp":1743698356000},"source":"Crossref","is-referenced-by-count":1,"title":["New results on classical and quantum counter automata"],"prefix":"10.23638","volume":"vol. 21 no. 4","author":[{"given":"Masaki","family":"Nakanishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aida","family":"Gainutdinova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2019,9,27]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1412.6761v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1412.6761v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:39:16Z","timestamp":1743698356000},"score":1,"resource":{"primary":{"URL":"http:\/\/dmtcs.episciences.org\/1528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,27]]},"references-count":0,"journal-issue":{"issue":"Automata, Logic and Semantics","published-online":{"date-parts":[[2019,9,27]]}},"URL":"https:\/\/doi.org\/10.23638\/dmtcs-21-4-12","relation":{"has-preprint":[{"id-type":"arxiv","id":"1412.6761v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1412.6761v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1412.6761","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1412.6761","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"type":"electronic","value":"1365-8050"}],"subject":[],"published":{"date-parts":[[2019,9,27]]},"article-number":"1528"}}