{"id":"https://openalex.org/W1498955885","doi":"https://doi.org/10.1007/978-3-319-53733-7_31","title":"Detecting Useless Transitions in Pushdown Automata","display_name":"Detecting Useless Transitions in Pushdown Automata","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W1498955885","doi":"https://doi.org/10.1007/978-3-319-53733-7_31","mag":"1498955885"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53733-7_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53733-7_31","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":true,"oa_status":"green","oa_url":"https://research.vu.nl/en/publications/57ae9d13-5c8b-4aaa-b2ed-b1607f366e54","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000200591","display_name":"Dick Grune","orcid":null},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Dick Grune","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078610814","display_name":"Wan Fokkink","orcid":"https://orcid.org/0000-0001-7443-8978"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wan Fokkink","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027516880","display_name":"Evangelos Chatzikalymnios","orcid":"https://orcid.org/0000-0003-0520-9658"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Evangelos Chatzikalymnios","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012379494","display_name":"Brinio Hond","orcid":null},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Brinio Hond","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011851357","display_name":"Peter Rutgers","orcid":null},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Peter Rutgers","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5000200591"],"corresponding_institution_ids":["https://openalex.org/I865915315"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00417537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"421","last_page":"434"},"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.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/T12072","display_name":"Machine Learning and Algorithms","score":0.9965000152587891,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.930903434753418},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7474817037582397},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.692342221736908},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6626091003417969},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6335665583610535},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5186390280723572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48858246207237244},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3731878101825714},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.22224566340446472},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17422786355018616},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.1309581696987152}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.930903434753418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7474817037582397},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.692342221736908},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6626091003417969},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6335665583610535},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5186390280723572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48858246207237244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3731878101825714},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.22224566340446472},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17422786355018616},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.1309581696987152},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-319-53733-7_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53733-7_31","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"},{"id":"pmh:oai:research.vu.nl:openaire/57ae9d13-5c8b-4aaa-b2ed-b1607f366e54","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/57ae9d13-5c8b-4aaa-b2ed-b1607f366e54","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Grune, D, Fokkink, W, Chatzikalymnios, E, Hond, B & Rutgers, P 2017, Detecting useless transitions in pushdown automata. in F Drewes, C Mart\u00edn-Vide & B Truthe (eds), Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10168 LNCS, Springer/Verlag, pp. 421-434, 11th International Conference on Language and Automata Theory and Applications, LATA 2017, Umea, Sweden, 6/03/17. https://doi.org/10.1007/978-3-319-53733-7_31","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:library.tue.nl:871662","is_oa":false,"landing_page_url":"http://repository.tue.nl/871662","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:877556","is_oa":false,"landing_page_url":"http://repository.tue.nl/877556","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/2c7cbfb7-bb48-43bb-af7a-0f9de440cdd9","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/detecting-useless-transitions-in-pushdown-automata(2c7cbfb7-bb48-43bb-af7a-0f9de440cdd9).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Umea, Sweden, March 6-9, 2017. Proceedings, 421 - 434","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:research.vu.nl:openaire/57ae9d13-5c8b-4aaa-b2ed-b1607f366e54","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/57ae9d13-5c8b-4aaa-b2ed-b1607f366e54","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Grune, D, Fokkink, W, Chatzikalymnios, E, Hond, B & Rutgers, P 2017, Detecting useless transitions in pushdown automata. in F Drewes, C Mart\u00edn-Vide & B Truthe (eds), Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10168 LNCS, Springer/Verlag, pp. 421-434, 11th International Conference on Language and Automata Theory and Applications, LATA 2017, Umea, Sweden, 6/03/17. https://doi.org/10.1007/978-3-319-53733-7_31","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W260642817","https://openalex.org/W1491036809","https://openalex.org/W1562942180","https://openalex.org/W1589224558","https://openalex.org/W1905205673","https://openalex.org/W1979564497","https://openalex.org/W2019570031","https://openalex.org/W2023439061","https://openalex.org/W2023445075","https://openalex.org/W2074593591","https://openalex.org/W2105590118","https://openalex.org/W2116034587","https://openalex.org/W2166714603","https://openalex.org/W2334129451","https://openalex.org/W2482236631","https://openalex.org/W3005728772","https://openalex.org/W4206078070"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W1972232894","https://openalex.org/W2472752294","https://openalex.org/W1511257926","https://openalex.org/W1486486721","https://openalex.org/W2012479020","https://openalex.org/W2074593591","https://openalex.org/W2522490152","https://openalex.org/W2108442331"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}