{"id":"https://openalex.org/W18618678","doi":"https://doi.org/10.1007/978-3-642-54830-7_1","title":"Equivalences of Pushdown Systems Are Hard","display_name":"Equivalences of Pushdown Systems Are Hard","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W18618678","doi":"https://doi.org/10.1007/978-3-642-54830-7_1","mag":"18618678"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-54830-7_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-54830-7_1","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-54830-7_1.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/978-3-642-54830-7_1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083815456","display_name":"Petr Jan\u010dar","orcid":"https://orcid.org/0000-0002-8738-9850"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr Jan\u010dar","raw_affiliation_strings":["Dept Comp. Sci., FEI, Techn. Univ. of Ostrava (V\u0160B-TUO), 17. Listopadu 15, 70833, Ostrava, Czech Rep"],"affiliations":[{"raw_affiliation_string":"Dept Comp. Sci., FEI, Techn. Univ. of Ostrava (V\u0160B-TUO), 17. Listopadu 15, 70833, Ostrava, Czech Rep","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083815456"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4025,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88275447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"28"},"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.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/T10126","display_name":"Logic, programming, and type systems","score":0.9983000159263611,"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/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8906903266906738},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7934378385543823},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7448180913925171},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.689481258392334},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.675506055355072},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5742324590682983},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5652111172676086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5423231720924377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4883089065551758},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.37399303913116455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2798686623573303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19617709517478943},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.18029853701591492},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16522499918937683},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.16182821989059448},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15419095754623413},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.15353602170944214},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.1489972174167633},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.11112743616104126},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.08157354593276978}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8906903266906738},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7934378385543823},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7448180913925171},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.689481258392334},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.675506055355072},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5742324590682983},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5652111172676086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5423231720924377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4883089065551758},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.37399303913116455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2798686623573303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19617709517478943},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.18029853701591492},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16522499918937683},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.16182821989059448},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15419095754623413},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.15353602170944214},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.1489972174167633},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.11112743616104126},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.08157354593276978}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-54830-7_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-54830-7_1","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-54830-7_1.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"}],"best_oa_location":{"id":"doi:10.1007/978-3-642-54830-7_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-54830-7_1","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-54830-7_1.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":[{"display_name":"Quality Education","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W18618678.pdf","grobid_xml":"https://content.openalex.org/works/W18618678.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W50533088","https://openalex.org/W61031493","https://openalex.org/W173099331","https://openalex.org/W1508360721","https://openalex.org/W1508399233","https://openalex.org/W1539922307","https://openalex.org/W1555553717","https://openalex.org/W1580249729","https://openalex.org/W1589421353","https://openalex.org/W1602782925","https://openalex.org/W1624221421","https://openalex.org/W1991034910","https://openalex.org/W1998608869","https://openalex.org/W2002981190","https://openalex.org/W2018817970","https://openalex.org/W2045344413","https://openalex.org/W2051521505","https://openalex.org/W2064514470","https://openalex.org/W2078050093","https://openalex.org/W2088846354","https://openalex.org/W2096329705","https://openalex.org/W2099040330","https://openalex.org/W2109548990","https://openalex.org/W2111753126","https://openalex.org/W2121627515","https://openalex.org/W2129121801","https://openalex.org/W2132750992","https://openalex.org/W2151033407","https://openalex.org/W2155950827","https://openalex.org/W2156077630","https://openalex.org/W2500657807","https://openalex.org/W2596792952","https://openalex.org/W2951623158","https://openalex.org/W3022006420","https://openalex.org/W3099251988","https://openalex.org/W3104287458","https://openalex.org/W3125224867","https://openalex.org/W4234015612"],"related_works":["https://openalex.org/W1986683780","https://openalex.org/W4297892460","https://openalex.org/W2542491786","https://openalex.org/W2950911169","https://openalex.org/W1525520647","https://openalex.org/W2995466559","https://openalex.org/W1502255017","https://openalex.org/W2060254679","https://openalex.org/W2186244857","https://openalex.org/W18618678"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}