{"id":"https://openalex.org/W2001329538","doi":"https://doi.org/10.1142/s0129054102001515","title":"PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES","display_name":"PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES","publication_year":2002,"publication_date":"2002-11-21","ids":{"openalex":"https://openalex.org/W2001329538","doi":"https://doi.org/10.1142/s0129054102001515","mag":"2001329538"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054102001515","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054102001515","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5084920912","display_name":"Nadia Nedjah","orcid":"https://orcid.org/0000-0002-1656-6397"},"institutions":[{"id":"https://openalex.org/I40034438","display_name":"Universidade do Estado do Rio de Janeiro","ror":"https://ror.org/0198v2949","country_code":"BR","type":"education","lineage":["https://openalex.org/I40034438"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"NADIA NEDJAH","raw_affiliation_strings":["Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Rua S\u00e3o Francisco Xavier, 524, Sala 5022-D, Maracan\u00e3, Rio de Janeiro, RJ, 20559-900, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Rua S\u00e3o Francisco Xavier, 524, Sala 5022-D, Maracan\u00e3, Rio de Janeiro, RJ, 20559-900, Brazil","institution_ids":["https://openalex.org/I40034438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048916912","display_name":"Luiza de Macedo Mourelle","orcid":"https://orcid.org/0000-0002-4680-2047"},"institutions":[{"id":"https://openalex.org/I40034438","display_name":"Universidade do Estado do Rio de Janeiro","ror":"https://ror.org/0198v2949","country_code":"BR","type":"education","lineage":["https://openalex.org/I40034438"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"LUIZA DE MACEDO MOURELLE","raw_affiliation_strings":["Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Rua S\u00e3o Francisco Xavier, 524, Sala 5022-D, Maracan\u00e3, Rio de Janeiro, RJ, 20559-900, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Rua S\u00e3o Francisco Xavier, 524, Sala 5022-D, Maracan\u00e3, Rio de Janeiro, RJ, 20559-900, Brazil","institution_ids":["https://openalex.org/I40034438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084920912"],"corresponding_institution_ids":["https://openalex.org/I40034438"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11384148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"06","first_page":"873","last_page":"887"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/rewriting","display_name":"Rewriting","score":0.7222018837928772},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.691199779510498},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6188895106315613},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5739603638648987},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5256235003471375},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.41570913791656494},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4145442247390747},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41403326392173767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.389192134141922},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37054744362831116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3460633158683777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3353397846221924},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22077316045761108}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.7222018837928772},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.691199779510498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6188895106315613},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5739603638648987},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5256235003471375},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.41570913791656494},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4145442247390747},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41403326392173767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.389192134141922},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37054744362831116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3460633158683777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3353397846221924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22077316045761108},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054102001515","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054102001515","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1868982956","https://openalex.org/W1985108724","https://openalex.org/W2014294283","https://openalex.org/W2165368330","https://openalex.org/W2171572532","https://openalex.org/W2421250929"],"related_works":["https://openalex.org/W1577306287","https://openalex.org/W2610542549","https://openalex.org/W1548463674","https://openalex.org/W3027890008","https://openalex.org/W1510965759","https://openalex.org/W3174875281","https://openalex.org/W2096488839","https://openalex.org/W1531715723","https://openalex.org/W2479515585","https://openalex.org/W2953483754"],"abstract_inverted_index":{"We":[0,42,61],"compile":[1],"pattern":[2],"matching":[3,15],"for":[4,78],"overlapping":[5],"patterns":[6],"in":[7,38],"term":[8],"rewriting":[9],"systems":[10],"into":[11],"a":[12],"minimal,":[13],"tree":[14,40,80],"automata.":[16],"The":[17],"use":[18],"of":[19,68],"directed":[20],"acyclic":[21],"graphs":[22],"that":[23],"shares":[24],"all":[25],"the":[26,39,58,66,69,79],"isomorphic":[27],"subautomata":[28,50],"allows":[29],"us":[30],"to":[31,47],"reduce":[32],"space":[33],"requirements.":[34],"These":[35],"are":[36],"duplicated":[37],"automaton.":[41,60,81],"design":[43],"an":[44],"efficient":[45],"method":[46],"identify":[48],"such":[49],"and":[51],"avoid":[52],"duplicating":[53],"their":[54],"construction":[55],"while":[56],"generating":[57],"dag":[59],"compute":[62],"some":[63],"bounds":[64,77],"on":[65,73],"size":[67],"automata,":[70],"thereby":[71],"improving":[72],"previously":[74],"known":[75],"equivalent":[76]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}