{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:31:24Z","timestamp":1777645884982,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","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,5]]},"abstract":"<jats:p>\n                    The state complexity of the star of union of an m-state DFA language and an n-state DFA language is proved to be 2\n                    <jats:sup>m+n\u22121<\/jats:sup>\n                    \u22122\n                    <jats:sup>m\u22121<\/jats:sup>\n                    \u22122\n                    <jats:sup>n\u22121<\/jats:sup>\n                    +1 for every alphabet of at least two letters. The state complexity of the star of intersection is established as 3\/4 2\n                    <jats:sup>mn<\/jats:sup>\n                    for every alphabet of six or more letters. This improves the recent results of A. Salomaa, K. Salomaa and Yu (\u201cState complexity of combined operations\u201d, Theoret. Comput. Sci., 383 (2007) 140\u2013152).\n                  <\/jats:p>","DOI":"10.3233\/fi-2011-502","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:40:10Z","timestamp":1575330010000},"page":"161-178","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":10,"title":["On the State Complexity of Star of Union and Star of Intersection"],"prefix":"10.1177","volume":"109","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[{"name":"Mathematical Institute, Slovak Academy of Sciences, Gre\u0161\u00e1kova 6, 040 01 Ko\u0161ice, Slovakia. jiraskov@saske.sk"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Turku, Turku FIN\u201320014, Finland, and Academy of Finland. alexander.okhotin@utu.fi"}],"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-502","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:39Z","timestamp":1777444419000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["10.3233\/FI-2011-502"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-502","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]]}}}