{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:33:36Z","timestamp":1777646016673,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2-3","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>We investigate and compare the descriptional power of unary probabilistic and nondeterministic automata (pfa's and nfa's, respectively). We show the existence of a family of languages hard for pfa's in the following sense: For any positive integer d, there exists a unary d-cyclic language such that any pfa accepting it requires d states, as the smallest deterministic automaton. On the other hand, we prove that there exist infinitely many languages having pfa's which from one side do not match a known optimal state lower bound and, on the other side, they are smaller than nfa's which, in turn, are smaller than deterministic automata.<\/jats:p>","DOI":"10.3233\/fi-2011-583","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:51:04Z","timestamp":1575330664000},"page":"119-135","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Size of Unary Probabilistic and Nondeterministic Automata"],"prefix":"10.1177","volume":"112","author":[{"given":"Maria Paola","family":"Bianchi","sequence":"first","affiliation":[{"name":"Dipartimento di Scienze dell'Informazione \u2013 Universit\u00e0 degli Studi di Milano, via Comelico 39, 20135 Milano, Italy. maria.bianchi@unimi.it, {mereghetti, palano}@dsi.unimi.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[{"name":"Dipartimento di Scienze dell'Informazione \u2013 Universit\u00e0 degli Studi di Milano, via Comelico 39, 20135 Milano, Italy. maria.bianchi@unimi.it, {mereghetti, palano}@dsi.unimi.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beatrice","family":"Palano","sequence":"additional","affiliation":[{"name":"Dipartimento di Scienze dell'Informazione \u2013 Universit\u00e0 degli Studi di Milano, via Comelico 39, 20135 Milano, Italy. maria.bianchi@unimi.it, {mereghetti, palano}@dsi.unimi.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica e Comunicazione \u2013 Universit\u00e0 degli Studi di Milano, via Comelico 39, 20135 Milano, Italy. pighizzini@dico.unimi.it"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2011,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-583","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:34:04Z","timestamp":1777444444000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":0,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.3233\/FI-2011-583"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-583","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}