{"id":"https://openalex.org/W3112952480","doi":"https://doi.org/10.3233/jifs-201298","title":"A minimization algorithm for fuzzy top-down tree automata over lattices","display_name":"A minimization algorithm for fuzzy top-down tree automata over lattices","publication_year":2020,"publication_date":"2020-12-11","ids":{"openalex":"https://openalex.org/W3112952480","doi":"https://doi.org/10.3233/jifs-201298","mag":"3112952480"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-201298","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-201298","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090411254","display_name":"Maryam Ghorani","orcid":"https://orcid.org/0000-0002-8673-6670"},"institutions":[{"id":"https://openalex.org/I176861719","display_name":"University of Shahrood","ror":"https://ror.org/00yqvtm78","country_code":"IR","type":"education","lineage":["https://openalex.org/I176861719"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Maryam Ghorani","raw_affiliation_strings":["Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran","institution_ids":["https://openalex.org/I176861719"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083617140","display_name":"Sunita Garhwal","orcid":"https://orcid.org/0000-0002-8959-3724"},"institutions":[{"id":"https://openalex.org/I162030827","display_name":"Thapar Institute of Engineering & Technology","ror":"https://ror.org/00wdq3744","country_code":"IN","type":"education","lineage":["https://openalex.org/I162030827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sunita Garhwal","raw_affiliation_strings":["Department of CSED, Thapar Institute of Engineering and Technology, Patiala, India","E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of CSED, Thapar Institute of Engineering and Technology, Patiala, India","institution_ids":["https://openalex.org/I162030827"]},{"raw_affiliation_string":"E-mail:","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090411254"],"corresponding_institution_ids":["https://openalex.org/I176861719"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21068841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"3","first_page":"4471","last_page":"4480"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6401254534721375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6339274048805237},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6246086359024048},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5818923115730286},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5665528178215027},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5296654105186462},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5095179677009583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4703657329082489},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33114615082740784},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26565733551979065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2159833014011383},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18300816416740417}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6401254534721375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6339274048805237},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6246086359024048},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5818923115730286},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5665528178215027},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5296654105186462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5095179677009583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4703657329082489},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33114615082740784},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26565733551979065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2159833014011383},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18300816416740417}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-201298","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-201298","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W159905155","https://openalex.org/W1929608480","https://openalex.org/W1968341794","https://openalex.org/W1986566706","https://openalex.org/W1988923095","https://openalex.org/W1991818639","https://openalex.org/W1996783109","https://openalex.org/W2035020702","https://openalex.org/W2038925304","https://openalex.org/W2050560741","https://openalex.org/W2073663206","https://openalex.org/W2080187126","https://openalex.org/W2089409100","https://openalex.org/W2090590025","https://openalex.org/W2092398161","https://openalex.org/W2103167029","https://openalex.org/W2118707006","https://openalex.org/W2119199978","https://openalex.org/W2132629030","https://openalex.org/W2255992692","https://openalex.org/W2306698938","https://openalex.org/W2389681900","https://openalex.org/W2464411087","https://openalex.org/W2610542549","https://openalex.org/W2725627089","https://openalex.org/W2755197125","https://openalex.org/W2769313928","https://openalex.org/W2813640253","https://openalex.org/W2887096025","https://openalex.org/W6677801837"],"related_works":["https://openalex.org/W1626184434","https://openalex.org/W2610542549","https://openalex.org/W2738050628","https://openalex.org/W1548463674","https://openalex.org/W2253092483","https://openalex.org/W3174875281","https://openalex.org/W1518712796","https://openalex.org/W2021535402","https://openalex.org/W2096488839","https://openalex.org/W2000634657"],"abstract_inverted_index":{"In":[0],"this":[1,20,60],"paper,":[2],"we":[3,46,62,77,91,107,150],"study":[4],"fuzzy":[5],"top-down":[6],"tree":[7,147],"automata":[8],"over":[9],"lattices":[10],"(":[11],"LTA":[12,29,42,57,67,74,86,98,125],"s":[13,30,43],",":[14],"for":[15,28,55],"short).":[16],"The":[17,116],"purpose":[18],"of":[19,37,50,112,158],"contribution":[21],"is":[22,69,99],"to":[23,71,81,102,122,139,154],"investigate":[24],"the":[25,35,48,51,83,94,103,109,113,133,135,156,159],"minimization":[26,129],"problem":[27],".":[31,44,58,75],"We":[32],"first":[33],"define":[34],"concept":[36],"statewise":[38,52,65,84,96,100],"equivalence":[39],"between":[40],"two":[41],"Thereafter,":[45],"show":[47,92,155],"existence":[49],"minimal":[53,85,97],"form":[54],"an":[56,79],"To":[59],"end,":[61],"find":[63,82],"a":[64,72,89,141],"irreducible":[66],"which":[68],"equivalent":[70,101],"given":[73,104,114,124,131],"Then,":[76],"provide":[78,151],"algorithm":[80,118],"and":[87],"by":[88],"theorem,":[90],"that":[93],"output":[95],"input.":[105],"Moreover,":[106],"compute":[108],"time":[110],"complexity":[111],"algorithm.":[115,161],"proposed":[117],"can":[119],"be":[120,140],"applied":[121],"any":[123],"and,":[126],"unlike":[127],"some":[128,152],"algorithms":[130],"in":[132],"literature,":[134],"input":[136],"doesn\u2019t":[137],"need":[138],"complete,":[142],"deterministic,":[143],"or":[144],"reduced":[145],"lattice-valued":[146],"automaton.":[148],"Finally,":[149],"examples":[153],"efficiency":[157],"presented":[160]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}