{"id":"https://openalex.org/W1804522637","doi":"https://doi.org/10.1007/978-3-540-74456-6_13","title":"Height-Deterministic Pushdown Automata","display_name":"Height-Deterministic Pushdown Automata","publication_year":2007,"publication_date":"2007-08-14","ids":{"openalex":"https://openalex.org/W1804522637","doi":"https://doi.org/10.1007/978-3-540-74456-6_13","mag":"1804522637"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74456-6_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_13","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/A5077221909","display_name":"Dirk Nowotka","orcid":"https://orcid.org/0000-0002-5422-2229"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dirk Nowotka","raw_affiliation_strings":["Institut f\u00fcr Formale Methoden der Informatik, Universit\u00e4t Stuttgart, Germany","Institut f\u00fcr Formale Methoden der Informatik, Universit\u00e4t Stuttgart, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Formale Methoden der Informatik, Universit\u00e4t Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"Institut f\u00fcr Formale Methoden der Informatik, Universit\u00e4t Stuttgart, Germany#TAB#","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009728620","display_name":"J\u01d0\u0155\u0131 Srba","orcid":"https://orcid.org/0000-0001-5551-6547"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Srba","raw_affiliation_strings":["BRICS,Department of Computer Science, Aalborg University, Denmark","Department of Computer Science, Aalborg University, Denmark,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS,Department of Computer Science, Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department of Computer Science, Aalborg University, Denmark,","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.7463,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.9436705,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"125","last_page":"134"},"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.9991000294685364,"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.9976999759674072,"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.9150719046592712},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8625114560127258},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7072101831436157},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7057343125343323},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6312329769134521},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6076540350914001},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5779165029525757},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5378285050392151},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45143774151802063},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.44430458545684814},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4398390054702759},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4125930368900299},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.326193243265152},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.26431983709335327},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2629168629646301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2368498146533966},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.223871111869812},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.15902256965637207},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.15559571981430054},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.15109294652938843},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09215694665908813},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.09036287665367126},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.06484290957450867}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.9150719046592712},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8625114560127258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7072101831436157},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7057343125343323},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6312329769134521},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6076540350914001},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5779165029525757},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5378285050392151},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45143774151802063},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.44430458545684814},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4398390054702759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4125930368900299},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.326193243265152},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.26431983709335327},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2629168629646301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2368498146533966},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.223871111869812},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.15902256965637207},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.15559571981430054},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.15109294652938843},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09215694665908813},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.09036287665367126},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.06484290957450867}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-74456-6_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_13","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:CiteSeerX.psu:10.1.1.570.7155","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.570.7155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.aau.dk/~srba/files/NS:MFCS:07.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/03b6ed90-a247-11dc-8188-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/03b6ed90-a247-11dc-8188-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nowotka, D & Srba, J 2007, Height-Deterministic Pushdown Automata. in 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS'07), LNCS. 4708 edn, vol. LNCS, Springer, pp. 125-134, 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS'07), Cesky Krumlov, Czech Republic, 27/08/2007.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W180382289","https://openalex.org/W1484039100","https://openalex.org/W1486486721","https://openalex.org/W1491036809","https://openalex.org/W1556566737","https://openalex.org/W1577235157","https://openalex.org/W1589421353","https://openalex.org/W1725438563","https://openalex.org/W1891022440","https://openalex.org/W2002089154","https://openalex.org/W2102502119","https://openalex.org/W2132638915","https://openalex.org/W2137370934","https://openalex.org/W2151033407","https://openalex.org/W2152221608","https://openalex.org/W2164822567","https://openalex.org/W2479946866","https://openalex.org/W2498250661","https://openalex.org/W2738295415"],"related_works":["https://openalex.org/W2403684796","https://openalex.org/W2023439061","https://openalex.org/W2041168146","https://openalex.org/W1530104041","https://openalex.org/W2519987770","https://openalex.org/W4307896660","https://openalex.org/W1989948713","https://openalex.org/W2117431842","https://openalex.org/W1565488213","https://openalex.org/W2513316208"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}