{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:33:22Z","timestamp":1751294002339,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031711114"},{"type":"electronic","value":"9783031711121"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71112-1_9","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:02:14Z","timestamp":1725328934000},"page":"124-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Block Languages and\u00a0Their Bitmap Representations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4119-0694","authenticated-orcid":false,"given":"Guilherme","family":"Duarte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0861-0105","authenticated-orcid":false,"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-4965","authenticated-orcid":false,"given":"Luca","family":"Prigioniero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9668-0917","authenticated-orcid":false,"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,3]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1142\/S0129054108005930","volume":"19","author":"M Almeida","year":"2008","unstructured":"Almeida, M., Moreira, N., Reis, R.: Exact generation of minimal acyclic deterministic finite automata. Int. J. Found. Comput. Sci. 19(4), 751\u2013765 (2008). https:\/\/doi.org\/10.1142\/S0129054108005930","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR2","unstructured":"Almeida, M., Moreira, N., Reis, R.: Finite automata minimization algorithms. In: Wang, J. (ed.) Handbook of Finite State Based Models and Applications, pp. 145\u2013170. CRC Press (2012)"},{"issue":"2\u20133","key":"9_CR3","first-page":"189","volume":"9","author":"C C\u00e2mpeanu","year":"2004","unstructured":"C\u00e2mpeanu, C., Ho, W.H.: The maximum state complexity for finite languages. J. Autom. Lang. Comb. 9(2\u20133), 189\u2013202 (2004)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1142\/S0129054112400059","volume":"23","author":"K Dudzinski","year":"2012","unstructured":"Dudzinski, K., Konstantinidis, S.: Formal descriptions of code properties: decidability, complexity, implementation. Int. J. Found. Comput. Sci. 23(1), 67\u201385 (2012). https:\/\/doi.org\/10.1142\/S0129054112400059","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Elvey Price, A., Fang, W., Wallner, M.: Compacted binary trees admit a stretched exponential. J. Comb. Theory Ser. A 177, 105306 (2021). https:\/\/doi.org\/10.1016\/J.JCTA.2020.105306","DOI":"10.1016\/J.JCTA.2020.105306"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Karhum\u00e4ki, J., Kari, J.: Finite automata, image manipulation, and automatic real functions. In: Pin, J. (ed.) Handbook of Automata Theory, pp. 1105\u20131143. European Mathematical Society (2021). https:\/\/doi.org\/10.4171\/AUTOMATA-2\/8","DOI":"10.4171\/AUTOMATA-2\/8"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-13350-8_6","volume-title":"Computing with New Resources","author":"J Karhum\u00e4ki","year":"2014","unstructured":"Karhum\u00e4ki, J., Okhotin, A.: On the determinization blowup for finite automata recognizing equal-length languages. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 71\u201382. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13350-8_6"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-030-14812-6_24","volume-title":"Theory and Applications of Models of Computation","author":"B Kjos-Hanssen","year":"2019","unstructured":"Kjos-Hanssen, B., Liu, L.: The number of languages with maximum state complexity. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 394\u2013409. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_24"},{"key":"9_CR9","first-page":"169","volume":"52","author":"S Konstantinidis","year":"2018","unstructured":"Konstantinidis, S., Moreira, N., Reis, R.: Randomized generation of error control codes with automata and transducers. RAIRO 52, 169\u2013184 (2018)","journal-title":"RAIRO"},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-50497-0","volume-title":"Decision Procedures: An Algorithmic Point of View","author":"D Kroening","year":"2016","unstructured":"Kroening, D., Strichman, O.: Decision Procedures: An Algorithmic Point of View. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-662-50497-0"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: 12th Annual Symposium on Switching and Automata Theory, Los Alamitos, pp. 188\u2013191. IEEE (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Priez, J.B.: Enumeration of minimal acyclic automata via generalized parking functions. In: 27th FPSAC. DMTCS, vol.\u00a02471 (2015). https:\/\/doi.org\/10.46298\/dmtcs.2471","DOI":"10.46298\/dmtcs.2471"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theor. Comput. Sci. 92(1), 181\u2013189 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_CR14","first-page":"177","volume":"2","author":"K Salomaa","year":"1997","unstructured":"Salomaa, K., Yu, S.: NFA to DFA transformation for finite languages over arbitrary alphabets. J. Autom. Lang. Comb. 2(3), 177\u2013186 (1997)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1016\/S0304-3975(02)00083-X","volume":"290","author":"P Shankar","year":"2003","unstructured":"Shankar, P., Dasgupta, A., Deshmukh, K., Rajan, B.S.: On viewing block codes as finite automata. Theor. Comput. Sci. 290(3), 1775\u20131797 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00083-X","journal-title":"Theor. Comput. Sci."},{"key":"9_CR16","unstructured":"Stockmeyer, L.: Set basis problem is NP-complete. Technical report. Report No. RC-5431, IBM Research Center (1976)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: 5th Annual ACM Symposium on Theory of Computing, pp.\u00a01\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71112-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:03:20Z","timestamp":1725329000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71112-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031711114","9783031711121"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71112-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}