{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:42:16Z","timestamp":1742967736248,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153488"},{"type":"electronic","value":"9783642153495"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15349-5_12","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T03:39:27Z","timestamp":1282361967000},"page":"176-182","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA"],"prefix":"10.1007","author":[{"given":"Zden\u011bk","family":"Sawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science\u00a047(2), 149\u2013158 (1986)","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","first-page":"235","volume-title":"LICS\u201909","author":"S. G\u00f6ller","year":"2009","unstructured":"G\u00f6ller, S., Mayr, R., To, A.W.: On the computational complexity of verifying one-counter processes. In: LICS\u201909, pp. 235\u2013244. IEEE Computer Society, Los Alamitos (2009), \n                    http:\/\/dx.doi.org\/10.1109\/LICS.2009.37"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","first-page":"261","volume-title":"Language and Automata Theory and Applications","author":"H. Gruber","year":"2008","unstructured":"Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 261\u2013272. Springer, Heidelberg (2008)"},{"key":"12_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability","author":"D.C. Kozen","year":"1997","unstructured":"Kozen, D.C.: Automata and Computability. Springer, Heidelberg (1997)"},{"key":"12_CR5","unstructured":"Martinez, A.: Efficient computation of regular expressions from unary nfas. In: Descriptional Complexity of Formal Systems, DFCS (2002)"},{"key":"12_CR6","unstructured":"Martinez, A.: Topics in Formal Languages: String Enumeration, Unary NFAs and State Complexity. Master\u2019s thesis, University of Waterloo (2002)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"issue":"17","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1016\/j.ipl.2009.06.005","volume":"109","author":"A.W. To","year":"2009","unstructured":"To, A.W.: Unary finite automata vs. arithmetic progressions. Information Processing Letterss\u00a0109(17), 1010\u20131014 (2009), \n                    http:\/\/dx.doi.org\/10.1016\/j.ipl.2009.06.005","journal-title":"Information Processing Letterss"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15349-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:49:18Z","timestamp":1675900158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-15349-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153488","9783642153495"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15349-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}