{"id":"https://openalex.org/W2090005588","doi":"https://doi.org/10.1109/tpami.1981.4767080","title":"Equivalence and Reduction of Expansive Tree Grammars","display_name":"Equivalence and Reduction of Expansive Tree Grammars","publication_year":1981,"publication_date":"1981-03-01","ids":{"openalex":"https://openalex.org/W2090005588","doi":"https://doi.org/10.1109/tpami.1981.4767080","mag":"2090005588","pmid":"https://pubmed.ncbi.nlm.nih.gov/21868937"},"language":"en","primary_location":{"id":"doi:10.1109/tpami.1981.4767080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.1981.4767080","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5031217795","display_name":"Alejandro Barrero","orcid":null},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Barrero","raw_affiliation_strings":["Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103086804","display_name":"R. C. Gonzalez","orcid":"https://orcid.org/0000-0003-2715-9946"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. C. Gonzalez","raw_affiliation_strings":["Department of Electrical Engineering, University of Tennessee, Knoxville, TN, USA","Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001169337","display_name":"Michael G. Thomason","orcid":"https://orcid.org/0000-0001-8625-9184"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. G. Thomason","raw_affiliation_strings":["Department of Computer Science, University of Tennessee, Knoxville, TN, USA","Department of Computer Science, University of Tennessee, Knoxville, TN 37916"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"Department of Computer Science, University of Tennessee, Knoxville, TN 37916","institution_ids":["https://openalex.org/I75027704"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.2603262,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"PAMI-3","issue":"2","first_page":"204","last_page":"206"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9995999932289124,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"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/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.8092159032821655},{"id":"https://openalex.org/keywords/regular-tree-grammar","display_name":"Regular tree grammar","score":0.7411664724349976},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6949475407600403},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.6676777601242065},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.598397433757782},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.5742093920707703},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5628976821899414},{"id":"https://openalex.org/keywords/expansive","display_name":"Expansive","score":0.5432204008102417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5428263545036316},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.5179802179336548},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.4881919026374817},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46600446105003357},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.4321364164352417},{"id":"https://openalex.org/keywords/combinatory-categorial-grammar","display_name":"Combinatory categorial grammar","score":0.424178808927536},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4164774715900421},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.40686818957328796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3503414988517761},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3350369930267334},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.33013367652893066},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.24228981137275696},{"id":"https://openalex.org/keywords/phrase-structure-rules","display_name":"Phrase structure rules","score":0.23798802495002747},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19839796423912048},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.13768211007118225}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.8092159032821655},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.7411664724349976},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6949475407600403},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.6676777601242065},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.598397433757782},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.5742093920707703},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5628976821899414},{"id":"https://openalex.org/C2780502288","wikidata":"https://www.wikidata.org/wiki/Q28838156","display_name":"Expansive","level":3,"score":0.5432204008102417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5428263545036316},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5179802179336548},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.4881919026374817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46600446105003357},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.4321364164352417},{"id":"https://openalex.org/C199837984","wikidata":"https://www.wikidata.org/wiki/Q730974","display_name":"Combinatory categorial grammar","level":5,"score":0.424178808927536},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4164774715900421},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40686818957328796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3503414988517761},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3350369930267334},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.33013367652893066},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.24228981137275696},{"id":"https://openalex.org/C80877019","wikidata":"https://www.wikidata.org/wiki/Q7188074","display_name":"Phrase structure rules","level":3,"score":0.23798802495002747},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19839796423912048},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.13768211007118225},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C30407753","wikidata":"https://www.wikidata.org/wiki/Q186191","display_name":"Compressive strength","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpami.1981.4767080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.1981.4767080","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},{"id":"pmid:21868937","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/21868937","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on pattern analysis and machine intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1768003599","https://openalex.org/W1984256985","https://openalex.org/W2052395110","https://openalex.org/W2056918046","https://openalex.org/W2147611619","https://openalex.org/W4400445037"],"related_works":["https://openalex.org/W19708530","https://openalex.org/W154689794","https://openalex.org/W1498792811","https://openalex.org/W2141471933","https://openalex.org/W2010708274","https://openalex.org/W2143932650","https://openalex.org/W1550951390","https://openalex.org/W110052063","https://openalex.org/W2347184389","https://openalex.org/W2890064930"],"abstract_inverted_index":{"The":[0],"equivalence":[1],"of":[2,4,17],"nonterminals":[3,19],"an":[5,21],"expansive":[6,22],"tree":[7,23],"grammar":[8],"is":[9],"considered.":[10],"Algorithms":[11],"are":[12],"presented":[13],"for":[14,20,25,30],"constructing":[15],"sets":[16],"equivalent":[18],"grammar,":[24,28],"reducing":[26],"the":[27,36],"and":[29],"determining":[31],"whether":[32],"two":[33],"grammars":[34],"generate":[35],"same":[37],"language.":[38]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}