{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T15:05:13Z","timestamp":1747062313246,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673250"],"award-info":[{"award-number":["61673250"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["GK201803008"],"award-info":[{"award-number":["GK201803008"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00500-023-08062-7","type":"journal-article","created":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T12:19:23Z","timestamp":1680610763000},"page":"6927-6938","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fuzzy pushdown automata based on complete residuated lattices: variants and computing powers"],"prefix":"10.1007","volume":"27","author":[{"given":"Haihui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luyao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongxia","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhimin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,4]]},"reference":[{"issue":"1","key":"8062_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tcs.2005.06.012","volume":"347","author":"PRJ Asveld","year":"2005","unstructured":"Asveld PRJ (2005) Fuzzy context-free languages-Part 1: generalized fuzzy context-free grammars. Theor Comput Sci 347(1):167\u2013190. https:\/\/doi.org\/10.1016\/j.tcs.2005.06.012","journal-title":"Theor Comput Sci"},{"issue":"1","key":"8062_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.tcs.2005.06.013","volume":"347","author":"PRJ Asveld","year":"2005","unstructured":"Asveld PRJ (2005) Fuzzy context-free languages-Part 2: recognition and parsing algorithms. Theor Comput Sci 347(1):191\u2013213. https:\/\/doi.org\/10.1016\/j.tcs.2005.06.013","journal-title":"Theor Comput Sci"},{"key":"8062_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ic.2015.08.001","volume":"244","author":"A Ballester-Bolinches","year":"2015","unstructured":"Ballester-Bolinches A, Cosme-Ll\u00f3pez E, Rutten J (2015) The dual equivalence of equations and coequations for automata. Inf Comput 244:49\u201375. https:\/\/doi.org\/10.1016\/j.ic.2015.08.001","journal-title":"Inf Comput"},{"issue":"2","key":"8062_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1080\/00207168108803274","volume":"10","author":"I Bucurescu","year":"1981","unstructured":"Bucurescu I, Pascu A (1981) Fuzzy pushdown automata. Int J Comput Math 10(2):109\u2013119. https:\/\/doi.org\/10.1080\/00207168108803274","journal-title":"Int J Comput Math"},{"key":"8062_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0633-1","author":"R B\u011blohl\u00e1vek","year":"2002","unstructured":"B\u011blohl\u00e1vek R (2002) Fuzzy relational systems: foundations and Principles. Kluwer. https:\/\/doi.org\/10.1007\/978-1-4615-0633-1","journal-title":"Kluwer"},{"key":"8062_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ins.2011.12.024","volume":"191","author":"YZ Cao","year":"2012","unstructured":"Cao YZ, Ezawa Y (2012) Nondeterministic fuzzy automata. Inf Sci 191:86\u201397. https:\/\/doi.org\/10.1016\/j.ins.2011.12.024","journal-title":"Inf Sci"},{"key":"8062_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.fss.2011.07.003","volume":"186","author":"M \u0106iri\u0107","year":"2012","unstructured":"\u0106iri\u0107 M, Ignjatovi\u0107 J, Damljanovi\u0107 N (2012) Bisimulations for fuzzy automata. Fuzzy Sets Syst 186:100\u2013139. https:\/\/doi.org\/10.1016\/j.fss.2011.07.003","journal-title":"Fuzzy Sets Syst"},{"key":"8062_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.fss.2012.05.006","volume":"208","author":"M \u0106iri\u0107","year":"2012","unstructured":"\u0106iri\u0107 M, Ignjatovi\u0107 J, Jan\u010di\u0107 I, Damljanovi\u0107 N (2012) Computation of the greatest simulations and bisimulations between fuzzy automata. Fuzzy Sets Syst 208:22\u201342. https:\/\/doi.org\/10.1016\/j.fss.2012.05.006","journal-title":"Fuzzy Sets Syst"},{"key":"8062_CR9","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.tcs.2019.01.016","volume":"777","author":"M Droste","year":"2019","unstructured":"Droste M, Dziadek S, Kuich W (2019) Weighted simple reset pushdown automata. Theor Comput Sci 777:252\u2013259. https:\/\/doi.org\/10.1016\/j.tcs.2019.01.016","journal-title":"Theor Comput Sci"},{"key":"8062_CR10","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-2(1:2)2006","author":"J Esparza","year":"2006","unstructured":"Esparza J, Ku\u010dera A, Mayr R (2006) Model checking probabilistic pushdown automata. Log Methods Comput Sci. https:\/\/doi.org\/10.2168\/LMCS-2(1:2)2006","journal-title":"Log Methods Comput Sci"},{"key":"8062_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S1571-0661(05)80426-8","volume":"9","author":"A Finkel","year":"1997","unstructured":"Finkel A, Willems B, Wolper P (1997) A direct symbolic approach to model checking pushdown systems (extended abstract). Electron Notes Theor Comput Sci 9:27\u201337. https:\/\/doi.org\/10.1016\/S1571-0661(05)80426-8","journal-title":"Electron Notes Theor Comput Sci"},{"key":"8062_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.fss.2011.10.003","volume":"199","author":"XH Guo","year":"2012","unstructured":"Guo XH (2012) A comment on \u201cautomata theory based on complete residuated lattice-valued logic: pushdown automata\u2019\u2019. Fuzzy Sets Syst 199:130\u2013135. https:\/\/doi.org\/10.1016\/j.fss.2011.10.003","journal-title":"Fuzzy Sets Syst"},{"key":"8062_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5300-3","volume-title":"Metamathematics of fuzzy logic","author":"P H\u00e1jek","year":"1998","unstructured":"H\u00e1jek P (1998) Metamathematics of fuzzy logic. Kluwer Academic Publishers, Boston"},{"issue":"9","key":"8062_CR14","doi-asserted-by":"publisher","first-page":"2107","DOI":"10.3724\/SP.J.1001.2010.03855","volume":"21","author":"ZW Han","year":"2010","unstructured":"Han ZW, Li YM (2010) Pushdown automata and context-free grammars based on quantum logic. J Softw 21(9):2107\u20132117. https:\/\/doi.org\/10.3724\/SP.J.1001.2010.03855","journal-title":"J Softw"},{"issue":"2","key":"8062_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321450.321463","volume":"15","author":"JE Hopcroft","year":"1968","unstructured":"Hopcroft JE, Ullman JD (1968) Decidable and undecidable questions about automata. J Acm 15(2):317\u2013324. https:\/\/doi.org\/10.1145\/321450.321463","journal-title":"J Acm"},{"key":"8062_CR16","volume-title":"Introduction to automata theory, languages, and computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley Publishing, Boston"},{"issue":"1","key":"8062_CR17","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1186\/s40064-016-1764-x","volume":"5","author":"JH Jin","year":"2016","unstructured":"Jin JH, Li CQ (2016) The algebraic characterizations for a formal power series over complete strong bimonoids. SpringerPlus 5(1):1415\u20131426. https:\/\/doi.org\/10.1186\/s40064-016-1764-x","journal-title":"SpringerPlus"},{"issue":"21","key":"8062_CR18","doi-asserted-by":"publisher","first-page":"3232","DOI":"10.1016\/j.ins.2005.10.003","volume":"176","author":"P Li","year":"2006","unstructured":"Li P, Li YM (2006) Algebraic properties of LA-languages. Inf Sci 176(21):3232\u20133255. https:\/\/doi.org\/10.1016\/j.ins.2005.10.003","journal-title":"Inf Sci"},{"issue":"5","key":"8062_CR19","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1016\/j.ins.2010.11.006","volume":"181","author":"YM Li","year":"2011","unstructured":"Li YM (2011) Finite automata theory with membership values in lattices. Inf Sci 181(5):1003\u20131017. https:\/\/doi.org\/10.1016\/j.ins.2010.11.006","journal-title":"Inf Sci"},{"key":"8062_CR20","volume-title":"Fuzzy computing theory","author":"YM Li","year":"2016","unstructured":"Li YM, Li P (2016) Fuzzy computing theory. Science Press, Beijing, China"},{"issue":"1","key":"8062_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.fss.2005.04.004","volume":"156","author":"YM Li","year":"2005","unstructured":"Li YM, Pedrycz W (2005) Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets Syst 156(1):68\u201392. https:\/\/doi.org\/10.1016\/j.fss.2005.04.004","journal-title":"Fuzzy Sets Syst"},{"issue":"15","key":"8062_CR22","doi-asserted-by":"publisher","first-page":"2208","DOI":"10.1016\/j.ins.2005.05.001","volume":"176","author":"ZH Li","year":"2006","unstructured":"Li ZH, Li P, Li YM (2006) The relationships among several types of fuzzy automata. Inf Sci 176(15):2208\u20132226. https:\/\/doi.org\/10.1016\/j.ins.2005.05.001","journal-title":"Inf Sci"},{"key":"8062_CR23","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jcss.2019.10.001","volume":"108","author":"J Michaliszyn","year":"2020","unstructured":"Michaliszyn J, Otop J (2020) Non-deterministic weighted automata evaluated over markov chains. J Comput Syst Sci 108:118\u2013136. https:\/\/doi.org\/10.1016\/j.jcss.2019.10.001","journal-title":"J Comput Syst Sci"},{"issue":"6","key":"8062_CR24","doi-asserted-by":"publisher","first-page":"2144","DOI":"10.1109\/TFUZZ.2015.2404348","volume":"23","author":"I Mici\u0107","year":"2014","unstructured":"Mici\u0107 I, Jan\u010di\u0107 Z, Ignjatovi\u0107 J, \u0106iri\u0107 M (2014) Determinization of fuzzy automata by means of the degrees of language inclusion. IEEE Trans Fuzzy Syst 23(6):2144\u20132153. https:\/\/doi.org\/10.1109\/TFUZZ.2015.2404348","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"3","key":"8062_CR25","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ijar.2013.11.009","volume":"55","author":"HY Pan","year":"2014","unstructured":"Pan HY, Cao YZ, Zhang M, Chen YX (2014) Simulation for lattice-valued doubly labeled transition systems. Int J Approx Reason 55(3):797\u2013811. https:\/\/doi.org\/10.1016\/j.ijar.2013.11.009","journal-title":"Int J Approx Reason"},{"key":"8062_CR26","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ijar.2014.10.001","volume":"56","author":"HY Pan","year":"2015","unstructured":"Pan HY, Li YM, Cao YZ (2015) Lattice-valued simulations for quantitative transition systems. Int J Approx Reason 56:28\u201342. https:\/\/doi.org\/10.1016\/j.ijar.2014.10.001","journal-title":"Int J Approx Reason"},{"key":"8062_CR27","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ijar.2016.11.020","volume":"82","author":"HY Pan","year":"2017","unstructured":"Pan HY, Li YM, Cao YZ, Li P (2017) Nondeterministic fuzzy automata with membership values in complete residuated lattices. Int J Approx Reason 82:22\u201338. https:\/\/doi.org\/10.1016\/j.ijar.2016.11.020","journal-title":"Int J Approx Reason"},{"issue":"15","key":"8062_CR28","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TFUZZ.2018.2869127","volume":"27","author":"HY Pan","year":"2019","unstructured":"Pan HY, Song F, Cao YZ, Qian JY (2019) Fuzzy pushdown termination games. IEEE Trans Fuzzy Syst 27(15):760\u2013774. https:\/\/doi.org\/10.1109\/TFUZZ.2018.2869127","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"6","key":"8062_CR29","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/bf02713945","volume":"44","author":"DW Qiu","year":"2001","unstructured":"Qiu DW (2001) Automata theory based on complete residuated lattice-valued logic (I). Sci China (Ser F Inf Sci) 44(6):419\u2013429. https:\/\/doi.org\/10.1007\/bf02713945","journal-title":"Sci China (Ser F Inf Sci)"},{"issue":"06","key":"8062_CR30","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1360\/02yf9038","volume":"45","author":"DW Qiu","year":"2002","unstructured":"Qiu DW (2002) Automata theory based on complete residuated lattice-valued logic (II). Sci China (Ser F Inf Sci) 45(06):442\u2013452","journal-title":"Sci China (Ser F Inf Sci)"},{"issue":"15","key":"8062_CR31","doi-asserted-by":"publisher","first-page":"2128","DOI":"10.1016\/j.fss.2006.03.014","volume":"157","author":"DW Qiu","year":"2006","unstructured":"Qiu DW (2006) Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note. Fuzzy Sets Syst 157(15):2128\u20132138. https:\/\/doi.org\/10.1016\/j.fss.2006.03.014","journal-title":"Fuzzy Sets Syst"},{"issue":"1","key":"8062_CR32","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2007.05.026","volume":"386","author":"DW Qiu","year":"2007","unstructured":"Qiu DW (2007) Automata theory based on quantum logic: reversibilities and pushdown automata. Theor Comput Sci 386(1):38\u201356. https:\/\/doi.org\/10.1016\/j.tcs.2007.05.026","journal-title":"Theor Comput Sci"},{"issue":"4","key":"8062_CR33","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0019-9958(68)90864-4","volume":"13","author":"ES Santos","year":"1968","unstructured":"Santos ES (1968) Maximin automata. Inf Control 13(4):363\u2013377. https:\/\/doi.org\/10.1016\/S0019-9958(68)90864-4","journal-title":"Inf Control"},{"issue":"3","key":"8062_CR34","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0255(76)90040-2","volume":"10","author":"ES Santos","year":"1976","unstructured":"Santos ES (1976) Fuzzy automata and languages. Inf Sci 10(3):193\u2013197. https:\/\/doi.org\/10.1016\/0020-0255(76)90040-2","journal-title":"Inf Sci"},{"issue":"3","key":"8062_CR35","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","volume":"6","author":"M Sch\u00fctzenberger","year":"1963","unstructured":"Sch\u00fctzenberger M (1963) On context-free languages and push-down automata. Inf Control 6(3):246\u2013264. https:\/\/doi.org\/10.1016\/S0019-9958(63)90306-1","journal-title":"Inf Control"},{"key":"8062_CR36","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2014.07.001","volume":"549","author":"F Song","year":"2014","unstructured":"Song F, Touili T (2014) Efficient CTL model-checking for pushdown systems. Theor Comput Sci 549:127\u2013145. https:\/\/doi.org\/10.1016\/j.tcs.2014.07.001","journal-title":"Theor Comput Sci"},{"key":"8062_CR37","first-page":"62","volume":"49","author":"L Su","year":"1992","unstructured":"Su L (1992) A machine accepted fuzzy context-free languages-fuzzy pushdown automata. BUSEFAL 49:62\u201372","journal-title":"BUSEFAL"},{"issue":"2","key":"8062_CR38","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I Walukiewicz","year":"2001","unstructured":"Walukiewicz I (2001) Pushdown processes: games and model-checking. Inf Comput 164(2):234\u2013263. https:\/\/doi.org\/10.1006\/inco.2000.2894","journal-title":"Inf Comput"},{"key":"8062_CR39","doi-asserted-by":"crossref","unstructured":"Wang HH, Zhao LY, Li P (2019) An improved proof of the closure under homomorphic inverse of FCFL valued in lattice-ordered monoids. In: Sun X, He K, Chen X (eds.), Theoretical computer science. Singapore pp 64\u201375","DOI":"10.1007\/978-981-15-0105-0_5"},{"issue":"3","key":"8062_CR40","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/tssc.1969.300263","volume":"5","author":"WG Wee","year":"1969","unstructured":"Wee WG, Fu KS (1969) A formulation of fuzzy automata and its application as a model of learning systems. IEEE Trans Syst Sci Cybern 5(3):215\u2013223. https:\/\/doi.org\/10.1109\/tssc.1969.300263","journal-title":"IEEE Trans Syst Sci Cybern"},{"issue":"12","key":"8062_CR41","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1016\/j.fss.2009.12.011","volume":"161","author":"LH Wu","year":"2010","unstructured":"Wu LH, Qiu DW (2010) Automata theory based on complete residuated lattice-valued logic: reduction and minimization. Fuzzy Sets Syst 161(12):1635\u20131656. https:\/\/doi.org\/10.1016\/j.fss.2009.12.011","journal-title":"Fuzzy Sets Syst"},{"issue":"13","key":"8062_CR42","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1016\/j.fss.2007.01.012","volume":"158","author":"HY Xing","year":"2007","unstructured":"Xing HY (2007) Fuzzy pushdown automata. Fuzzy Sets Syst 158(13):1437\u20131449. https:\/\/doi.org\/10.1016\/j.fss.2007.01.012","journal-title":"Fuzzy Sets Syst"},{"issue":"16","key":"8062_CR43","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1016\/j.fss.2009.01.007","volume":"160","author":"HY Xing","year":"2009","unstructured":"Xing HY, Qiu DW (2009) Automata theory based on complete residuated lattice-valued logic: a categorical approach. Fuzzy Sets Syst 160(16):2416\u20132428. https:\/\/doi.org\/10.1016\/j.fss.2009.01.007","journal-title":"Fuzzy Sets Syst"},{"issue":"8","key":"8062_CR44","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1016\/j.fss.2008.06.016","volume":"160","author":"HY Xing","year":"2009","unstructured":"Xing HY, Qiu DW (2009) Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 160(8):1141\u20131151. https:\/\/doi.org\/10.1016\/j.fss.2008.06.016","journal-title":"Fuzzy Sets Syst"},{"key":"8062_CR45","doi-asserted-by":"publisher","unstructured":"Xing HY, Qiu DW, Liu F, Fan Z (2007) Equivalence in automata theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 158(13):1407\u20131422. https:\/\/doi.org\/10.1016\/j.fss.2007.01.008","DOI":"10.1016\/j.fss.2007.01.008"},{"key":"8062_CR46","doi-asserted-by":"publisher","unstructured":"Xing HY, Qiu DW, Liu FC (2009) Automata theory based on complete residuated lattice-valued logic: pushdown automata. Fuzzy Sets Syst 160(8):1125\u20131140. https:\/\/doi.org\/10.1016\/j.fss.2008.07.010","DOI":"10.1016\/j.fss.2008.07.010"},{"issue":"11","key":"8062_CR47","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1023\/A:1003642222321","volume":"39","author":"MS Ying","year":"2000","unstructured":"Ying MS (2000) Automata theory based on quantum logic (I). Int J Theor Phys 39(11):981\u2013991. https:\/\/doi.org\/10.1023\/A:1003642222321","journal-title":"Int J Theor Phys"},{"issue":"11","key":"8062_CR48","doi-asserted-by":"publisher","first-page":"2545","DOI":"10.1023\/A:1026453524064","volume":"39","author":"MS Ying","year":"2000","unstructured":"Ying MS (2000) Automata theory based on quantum logic (II). Int J Theor Phys 39(11):2545\u20132557. https:\/\/doi.org\/10.1023\/A:1026453524064","journal-title":"Int J Theor Phys"},{"key":"8062_CR49","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2016.06.031","volume":"774","author":"L Zhao","year":"2019","unstructured":"Zhao L, Wang XB, Duan ZH (2019) Model checking of pushdown systems for projection temporal logic. Theor Comput Sci 774:82\u201394. https:\/\/doi.org\/10.1016\/j.tcs.2016.06.031","journal-title":"Theor Comput Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08062-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08062-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08062-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,10]],"date-time":"2023-12-10T05:50:31Z","timestamp":1702187431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08062-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,4]]},"references-count":49,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["8062"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08062-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2023,4,4]]},"assertion":[{"value":"21 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}