{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T06:12:29Z","timestamp":1740809549929,"version":"3.38.0"},"reference-count":25,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transinf.2024fcp0008","type":"journal-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T22:11:52Z","timestamp":1724105512000},"page":"229-238","source":"Crossref","is-referenced-by-count":0,"title":["Bilaterally Colored Finite Automata and Bilaterally Colored Regular Expressions"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Akira","family":"ITO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"TAKAHASHI","sequence":"additional","affiliation":[{"name":"National Institute of Technology, Oshima College"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Yu, \u201cRegular languages,\u201d Handbook of Formal Languages, vol.1, pp.43-110, Springer, 1997. 10.1007\/978-3-642-59136-5_2","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"2","unstructured":"[2] D. Perrin, \u201cFinite automata,\u201d Handbook of Theoretical Computer Science, vol.B, The MIT Press, pp.1-57, 1991."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] L. D\u2019Antoni and M. Veanes, \u201cAutomata modulo theories,\u201d Communication of the ACM, vol.64, no.5, pp.86-95, 2021. 10.1145\/3419404","DOI":"10.1145\/3419404"},{"key":"4","unstructured":"[4] S.T. O\u2019Neil, A Primer for Computational Biology, Oregon State University Press, 2017."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] K.N. Kumar and S. Sukumaran, \u201cA survey on network intrusion detection system techniques,\u201d International Journal of Advanced Technology and Engineering Exploration, vol.5, no.47, pp.385-393, 2018. 10.19101\/ijatee.2018.546013","DOI":"10.19101\/IJATEE.2018.546013"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Y. Takahashi and A. Ito, \u201cFinite Automata with Colored Accepting States and Their Unmixedness Problems,\u201d IEICE Trans. Inf. & Syst., vol.E105-D, no.3, pp.491-502, 2022. 10.1587\/transinf.2021fcp0012","DOI":"10.1587\/transinf.2021FCP0012"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Y. Takahashi and A. Ito, \u201cOn the Unmixedness Problems of Colored Pushdown Automata,\u201d IEICE Trans. Inf. & Syst., vol.E106-D, no.3, pp.303-308, March 2023. 10.1587\/transinf.2022fcp0005","DOI":"10.1587\/transinf.2022FCP0005"},{"key":"8","unstructured":"[8] A. Asperti, C.S. Coen, and E. Tassi, \u201cRegular expressions,\u201d au point. CoRRabs\/1010.2604, 2010, http:\/\/arxiv.org\/abs\/1010.2604.pdf (extracted 2024)."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] A. Asperti, \u201cA compact proof of decidability for regular expression equivalence,\u201d LNCS, vol.7406, pp.283-298, Springer, 2012. 10.1007\/978-3-642-32347-8_19","DOI":"10.1007\/978-3-642-32347-8_19"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] T. Nipkow and D. Traytel, \u201cUnified decision procedures for regular expression equivalence,\u201d LNCS, vol.8558, pp.450-466, Springer, 2014. 10.1007\/978-3-319-08970-6_29","DOI":"10.1007\/978-3-319-08970-6_29"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] J. Sakarovitch, \u201cAutomata and rational expressions,\u201d Handbook of Automata Theory, J.-E. Pin ed., EMS Publishing, pp.39-78, 2021. 10.4171\/automata-1\/2","DOI":"10.4171\/automata-1\/2"},{"key":"12","unstructured":"[12] J.E. Hopcroft, R. Motowani, and J.D. Ullman, Intoroduction to Automaton Theory, Languages, and Computation, Addison-Wesley Longman, 3rd ed, Pearson Education, 2007."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] J.A. Brzozowski, \u201cDerivatives of Regular Expressions,\u201d J. ACM, vol.11, no.4, pp.481-494, 1964. 10.1145\/321239.321249","DOI":"10.1145\/321239.321249"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A. Ito and Y. Takahashi, \u201cBilaterally Colored Finite Automata and their Regular Expressions with Application to Context-Free Parsing,\u201d Proc. 2024 the 3rd International Conference on Computer Technologies, pp.39-47, 2024. 10.1109\/icctech61708.2024.00018","DOI":"10.1109\/ICCTech61708.2024.00018"},{"key":"15","unstructured":"[15] D.C. Kozen, Automata and Computability, Springer Science & Business Media, 2007. 10.1007\/978-1-4612-1844-9"},{"key":"16","unstructured":"[16] WHATWG.org, HTML Standard 4.10.5.1.5 Email state (type=email), https:\/\/html.spec.whatwg.org\/multipage\/input.html#email-state...1 (extracted 2024)."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] H. Gruber and M. Holzer, \u201cFrom Finite Automata to Regular Expressions and Back \u2014 A Summary on Descriptional Complexity,\u201d Int. J. of Foundations of Computer Science, vol.26, no.8, pp.1009-1040, 2015. 10.1142\/s0129054115400110","DOI":"10.1142\/S0129054115400110"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] M.V. Lawson, Finite Automata, CRC Press, 2004. 10.1201\/9781482285840","DOI":"10.1201\/9781482285840"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] J. Sakarovitch, Elements of Automata Theory, Cambridge University Press, 2009.","DOI":"10.1017\/CBO9781139195218"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] S. Broda, M. Holzer, E. Maia, N. Moreira, and R. Reis, \u201cOn the Mother of All Automata: the Position Automaton,\u201d LNCS, vol.10396, pp.134-146, Springer, 2017. 10.1007\/978-3-319-62809-7_9","DOI":"10.1007\/978-3-319-62809-7_9"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] S. Fischer, F. Huch, and T. Wilke, \u201cA play on regular expressions: functional pearl,\u201d ACM SIGPLAN Notices, vol.45, no.9, pp.357-368, 2010. 10.1145\/1932681.1863594","DOI":"10.1145\/1932681.1863594"},{"key":"22","unstructured":"[22] A.V. Aho, et al., Compilers: principles, techniques, and tools - 2nd ed., Pearson Education, 2007."},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] A. Br\u00fcggemann-Klein, \u201cRegular expressions into finite automata,\u201d Theoretical Computer Science, vol.120, no.2, pp.197-213, 1993. 10.1016\/0304-3975(93)90287-4","DOI":"10.1016\/0304-3975(93)90287-4"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] V. Antimirov, \u201cPartial derivatives of regular expressions and finite automaton constructions,\u201d Theoretical Computer Science, vol.155, no.2, pp.291-319, 1996. 10.1016\/0304-3975(95)00182-4","DOI":"10.1016\/0304-3975(95)00182-4"},{"key":"25","unstructured":"[25] A. Ito, biCREtools, GitHub repository, https:\/\/github.com\/ubeito\/biCREtools (extracted 2024)."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0008\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:33:44Z","timestamp":1740800024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0008\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024fcp0008","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024FCP0008"}}