{"id":"https://openalex.org/W174890186","doi":"https://doi.org/10.1007/978-3-642-23217-6_14","title":"Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations","display_name":"Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W174890186","doi":"https://doi.org/10.1007/978-3-642-23217-6_14","mag":"174890186"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-23217-6_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-23217-6_14","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/A5078894561","display_name":"Salvatore La Torre","orcid":"https://orcid.org/0000-0002-4978-4307"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Salvatore La Torre","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 degli Studi di Salerno, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028876512","display_name":"Margherita Napoli","orcid":"https://orcid.org/0000-0001-6969-8273"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Margherita Napoli","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 degli Studi di Salerno, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078894561"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":11.2845,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.99215686,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"203","last_page":"218"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7710413932800293},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7281180620193481},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.716187596321106},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7070063948631287},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.704936146736145},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5992018580436707},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5780737400054932},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5053704380989075},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4495497941970825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40547841787338257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36551111936569214},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.35417914390563965},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3002520799636841},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20848453044891357}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7710413932800293},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7281180620193481},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.716187596321106},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7070063948631287},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.704936146736145},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5992018580436707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5780737400054932},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5053704380989075},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4495497941970825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40547841787338257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36551111936569214},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.35417914390563965},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3002520799636841},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20848453044891357},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-23217-6_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-23217-6_14","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":21,"referenced_works":["https://openalex.org/W1493367105","https://openalex.org/W1545371423","https://openalex.org/W1554834491","https://openalex.org/W1556566737","https://openalex.org/W1566306817","https://openalex.org/W1598142426","https://openalex.org/W1842117537","https://openalex.org/W1933255669","https://openalex.org/W2061751777","https://openalex.org/W2087046173","https://openalex.org/W2090064527","https://openalex.org/W2099608328","https://openalex.org/W2101936540","https://openalex.org/W2107398710","https://openalex.org/W2132638915","https://openalex.org/W2135948849","https://openalex.org/W2136877520","https://openalex.org/W2143502475","https://openalex.org/W2148778089","https://openalex.org/W2165546792","https://openalex.org/W4214848047"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W1993478572","https://openalex.org/W2489809986","https://openalex.org/W1513999490","https://openalex.org/W2119045600"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}