{"id":"https://openalex.org/W2066680155","doi":"https://doi.org/10.1305/ndjfl/1093636941","title":"On $n$-equivalence of binary trees.","display_name":"On $n$-equivalence of binary trees.","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W2066680155","doi":"https://doi.org/10.1305/ndjfl/1093636941","mag":"2066680155"},"language":"es","primary_location":{"id":"doi:10.1305/ndjfl/1093636941","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093636941","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-28/issue-2/On-n-equivalence-of-binary-trees/10.1305/ndjfl/1093636941.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-28/issue-2/On-n-equivalence-of-binary-trees/10.1305/ndjfl/1093636941.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012980961","display_name":"Kees Doets","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kees Doets","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012980961"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2071108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T11476","display_name":"Graph theory and applications","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9879999756813049,"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/mathematics","display_name":"Mathematics","score":0.6523857116699219},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6507939100265503},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4240795969963074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3720962405204773}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6523857116699219},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6507939100265503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4240795969963074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3720962405204773}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093636941","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093636941","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-28/issue-2/On-n-equivalence-of-binary-trees/10.1305/ndjfl/1093636941.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093636941","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093636941","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1093636941","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093636941","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-28/issue-2/On-n-equivalence-of-binary-trees/10.1305/ndjfl/1093636941.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2066680155.pdf","grobid_xml":"https://content.openalex.org/works/W2066680155.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"This":[0],"note":[1],"presents":[2],"a":[3,81],"simple":[4],"characterization":[5],"of":[6,9,27,36,53,80,96],"the":[7,20,50],"class":[8,51],"all":[10,26,94],"trees":[11,55],"which":[12],"are":[13,105],"^-elementary":[14],"equivalent":[15],"with":[16,23,65,84],"B":[17,66,82,97,108],"m":[18,32,67,69,83,85,98,100,109],":":[19],"binary":[21,54],"tree":[22,60],"one":[24],"root":[25],"whose":[28],"branches":[29],"have":[30],"length":[31],"(for":[33],"each":[34,78],"pair":[35],"positive":[37],"integers":[38],"n":[39,71,88,103],"and":[40,56],"m).":[41],"Section":[42,47,73],"1":[43],"contains":[44],"some":[45],"preliminaries.":[46],"2":[48,87,102],"introduces":[49],"Q(n)":[52],"proves":[57],"that":[58],"every":[59],"in":[61],"it":[62],"is":[63],"^-equivalent":[64],"whenever":[68],">2":[70],"-1.":[72],"3":[74],"shows":[75],"that,":[76],"conversely,":[77],"nequivalent":[79],">":[86],"-1":[89,104],"belongs":[90],"to":[91,107],"Q(n).":[92],"Finally,":[93],"^-equivalents":[95],"for":[99],"<":[101],"isomorphic":[106],".":[110]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}