{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:13:47Z","timestamp":1777644827157,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.3233\/fi-2013-802","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:20:52Z","timestamp":1575332452000},"page":"97-106","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata"],"prefix":"10.1177","volume":"123","author":[{"given":"Zden\u011bk","family":"Sawa","sequence":"first","affiliation":[{"name":"Center for Applied Cybernetics, Department of Computer Science, Technical University of Ostrava, 17. listopadu 15, Ostrava-Poruba, 708 33, Czech Republic. zdenek.sawa@vsb.cz"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2013-802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:30:27Z","timestamp":1777444227000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/FI-2013-802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013]]}},"URL":"https:\/\/doi.org\/10.3233\/fi-2013-802","relation":{},"ISSN":["0169-2968"],"issn-type":[{"value":"0169-2968","type":"print"}],"subject":[],"published":{"date-parts":[[2013]]}}}