{"id":"https://openalex.org/W2005630671","doi":"https://doi.org/10.1016/s0304-3975(03)00140-3","title":"Shape preserving top-down tree transducers","display_name":"Shape preserving top-down tree transducers","publication_year":2003,"publication_date":"2003-04-07","ids":{"openalex":"https://openalex.org/W2005630671","doi":"https://doi.org/10.1016/s0304-3975(03)00140-3","mag":"2005630671"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(03)00140-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00140-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical 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/A5061481182","display_name":"Zolt\u00e1n F\u00fcl\u00f6p","orcid":"https://orcid.org/0000-0002-3825-022X"},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n F\u00fcl\u00f6p","raw_affiliation_strings":["Department of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r 2, H-6720 Szeged, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r 2, H-6720 Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071606442","display_name":"Zsolt Gazdag","orcid":"https://orcid.org/0000-0002-5617-8743"},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Gazdag","raw_affiliation_strings":["Department of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r 2, H-6720 Szeged, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r 2, H-6720 Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I227486990"],"apc_list":{"value":2880,"currency":"USD","value_usd":2880},"apc_paid":null,"fwci":1.5662,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86756701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"304","issue":"1-3","first_page":"315","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","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/T12029","display_name":"DNA and Biological Computing","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5631930828094482},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4378272593021393},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42230454087257385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4122399091720581},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2595028281211853}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5631930828094482},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4378272593021393},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42230454087257385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4122399091720581},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2595028281211853}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(03)00140-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00140-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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":6,"referenced_works":["https://openalex.org/W1508735422","https://openalex.org/W1963587568","https://openalex.org/W2093769120","https://openalex.org/W2150256214","https://openalex.org/W3037477934","https://openalex.org/W4211152277"],"related_works":["https://openalex.org/W2748952813","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"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}