{"id":"https://openalex.org/W2160005349","doi":"https://doi.org/10.1007/3-540-45931-6_15","title":"Higher-Order Pushdown Trees Are Easy","display_name":"Higher-Order Pushdown Trees Are Easy","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2160005349","doi":"https://doi.org/10.1007/3-540-45931-6_15","mag":"2160005349"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45931-6_15","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-45931-6_15","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-45931-6_15.pdf","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":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/3-540-45931-6_15.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043054886","display_name":"Teodor Knapik","orcid":null},"institutions":[{"id":"https://openalex.org/I4210157513","display_name":"\u00c9cologie Marine Tropicale des Oc\u00e9ans Pacifique et Indien","ror":"https://ror.org/05kxt4539","country_code":"RE","type":"facility","lineage":["https://openalex.org/I102190016","https://openalex.org/I1294671590","https://openalex.org/I154202486","https://openalex.org/I24715933","https://openalex.org/I2802818602","https://openalex.org/I4210090127","https://openalex.org/I4210107625","https://openalex.org/I4210131494","https://openalex.org/I4210157513","https://openalex.org/I4210166444"]}],"countries":["RE"],"is_corresponding":true,"raw_author_name":"Teodor Knapik","raw_affiliation_strings":["Universit\u00e9 de la R\u00e9union, BP 7151, 97715, Saint Denis Messageries Cedex 9, R\u00e9union"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de la R\u00e9union, BP 7151, 97715, Saint Denis Messageries Cedex 9, R\u00e9union","institution_ids":["https://openalex.org/I4210157513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050366879","display_name":"Damian Niwi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Damian Niwi\u0144ski","raw_affiliation_strings":["Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081098905","display_name":"Pawe\u0142 Urzyczyn","orcid":"https://orcid.org/0000-0003-3719-9618"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Urzyczyn","raw_affiliation_strings":["Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043054886"],"corresponding_institution_ids":["https://openalex.org/I4210157513"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.2011,"has_fulltext":true,"cited_by_count":168,"citation_normalized_percentile":{"value":0.97550621,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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.9980000257492065,"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/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.9266766309738159},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.9158118963241577},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8459709882736206},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8429961204528809},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.7497929334640503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5911809802055359},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5435353517532349},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5007903575897217},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49657660722732544},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4913140833377838},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.450225293636322},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4343614876270294},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4164651930332184},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.4028988480567932},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4011094570159912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3371240496635437},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.327105313539505},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27546441555023193},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.18159714341163635},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.1750960350036621},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1556795835494995},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13483795523643494},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.09982925653457642},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.0760532021522522}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.9266766309738159},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.9158118963241577},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8459709882736206},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8429961204528809},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.7497929334640503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5911809802055359},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5435353517532349},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5007903575897217},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49657660722732544},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4913140833377838},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.450225293636322},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4343614876270294},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4164651930332184},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.4028988480567932},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4011094570159912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3371240496635437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.327105313539505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27546441555023193},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.18159714341163635},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.1750960350036621},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1556795835494995},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13483795523643494},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.09982925653457642},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0760532021522522},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-45931-6_15","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-45931-6_15","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-45931-6_15.pdf","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.5773","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://zls.mimuw.edu.pl/~niwinski/Prace/four4.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.3937","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.3937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.univ-reunion.fr/~knapik/publications/knu-fossacs02.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/3-540-45931-6_15","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-45931-6_15","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-45931-6_15.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2160005349.pdf","grobid_xml":"https://content.openalex.org/works/W2160005349.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1514729066","https://openalex.org/W1517623691","https://openalex.org/W1536644522","https://openalex.org/W1802033981","https://openalex.org/W1809956864","https://openalex.org/W1816620374","https://openalex.org/W1971416129","https://openalex.org/W1971835879","https://openalex.org/W1979853884","https://openalex.org/W1986249546","https://openalex.org/W2007098021","https://openalex.org/W2020520119","https://openalex.org/W2088846354","https://openalex.org/W2162583406","https://openalex.org/W2166211613","https://openalex.org/W2492028220","https://openalex.org/W3022006420","https://openalex.org/W3161017355","https://openalex.org/W4240244556"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W2089141720","https://openalex.org/W2400175085","https://openalex.org/W1914352394","https://openalex.org/W2171067235","https://openalex.org/W127918926","https://openalex.org/W3150008488","https://openalex.org/W4200019305"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":19}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}