{"id":"https://openalex.org/W1554012284","doi":"https://doi.org/10.1007/3-540-62064-8_29","title":"The tree equivalence problem for linear recursion schemes","display_name":"The tree equivalence problem for linear recursion schemes","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1554012284","doi":"https://doi.org/10.1007/3-540-62064-8_29","mag":"1554012284"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-62064-8_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-62064-8_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5071223623","display_name":"Viktor Sabelfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I4210092286","display_name":"Institute of Informatics Problems","ror":"https://ror.org/00n8bqs64","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210092286","https://openalex.org/I4210097085"]},{"id":"https://openalex.org/I4210152232","display_name":"Institute of Informatics of the Slovak Academy of Sciences","ror":"https://ror.org/04jgqpc26","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210152232"]}],"countries":["RU","SK"],"is_corresponding":true,"raw_author_name":"V. K. Sabelfeld","raw_affiliation_strings":["A. P. Ershov Institute of Informatics Systems, 630090, Novosibirsk, Russia","A. P. Ershov Institute of Informatics Systems"],"affiliations":[{"raw_affiliation_string":"A. P. Ershov Institute of Informatics Systems, 630090, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210092286"]},{"raw_affiliation_string":"A. P. Ershov Institute of Informatics Systems","institution_ids":["https://openalex.org/I4210152232"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071223623"],"corresponding_institution_ids":["https://openalex.org/I4210092286","https://openalex.org/I4210152232"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16629314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"350","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9937000274658203,"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.9937000274658203,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9564999938011169,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.949400007724762,"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/recursion","display_name":"Recursion (computer science)","score":0.8083809018135071},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7661259174346924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6731612682342529},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5658341646194458},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5284630656242371},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47133350372314453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42912960052490234},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.4241769313812256},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.41786617040634155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29715752601623535},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2883762717247009},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12220489978790283},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.12220478057861328}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8083809018135071},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7661259174346924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6731612682342529},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5658341646194458},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5284630656242371},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47133350372314453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42912960052490234},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.4241769313812256},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.41786617040634155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29715752601623535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2883762717247009},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12220489978790283},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.12220478057861328}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-62064-8_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-62064-8_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W97397928","https://openalex.org/W1560893303","https://openalex.org/W1973187217","https://openalex.org/W1986635205","https://openalex.org/W1988436966","https://openalex.org/W2000346568","https://openalex.org/W2012313512","https://openalex.org/W2016313399","https://openalex.org/W2024987067","https://openalex.org/W2049819904","https://openalex.org/W2053152889","https://openalex.org/W2073787041","https://openalex.org/W4213252762"],"related_works":["https://openalex.org/W2006836388","https://openalex.org/W2155605358","https://openalex.org/W2044963554","https://openalex.org/W2374742784","https://openalex.org/W1563586960","https://openalex.org/W3161063338","https://openalex.org/W2073366168","https://openalex.org/W4249703975","https://openalex.org/W2075052434","https://openalex.org/W560887346"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}