{"id":"https://openalex.org/W2086821293","doi":"https://doi.org/10.1007/s00236-009-0104-9","title":"On regular tree languages and deterministic pushdown automata","display_name":"On regular tree languages and deterministic pushdown automata","publication_year":2009,"publication_date":"2009-08-31","ids":{"openalex":"https://openalex.org/W2086821293","doi":"https://doi.org/10.1007/s00236-009-0104-9","mag":"2086821293"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-009-0104-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-009-0104-9","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","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/A5006012839","display_name":"Jan Janou\u0161ek","orcid":"https://orcid.org/0000-0001-9329-1000"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Janou\u0161ek","raw_affiliation_strings":["Department of Computer Science, Faculty of Information Technologies, Czech Technical University in Prague, Kolejni 550/2, 160 00, Praha 6, Czech Republic","Czech Technical University in Prague, Department of Computer Science, Faculty of Information Technologies, Kolejni 550/2, 160 00, Praha 6, Czech Republic#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Information Technologies, Czech Technical University in Prague, Kolejni 550/2, 160 00, Praha 6, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Czech Technical University in Prague, Department of Computer Science, Faculty of Information Technologies, Kolejni 550/2, 160 00, Praha 6, Czech Republic#TAB#","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111868243","display_name":"Bo\u0159ivoj Melichar","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Bo\u0159ivoj Melichar","raw_affiliation_strings":["Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo n\u00e1m. 13, 121 35, Prague 2, Czech Republic","Czech Technical University in Prague, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Karlovo n\u00e1m. 13, 121 35, Prague 2, Czech Republic#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo n\u00e1m. 13, 121 35, Prague 2, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Czech Technical University in Prague, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Karlovo n\u00e1m. 13, 121 35, Prague 2, Czech Republic#TAB#","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006012839"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.1844,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.91844509,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"46","issue":"7","first_page":"533","last_page":"547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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.9990000128746033,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.823925256729126},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7336426973342896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6343163847923279},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6262027621269226},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.6023918986320496},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5111656785011292},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5016179084777832},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.49012240767478943},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4819328784942627},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4620024859905243},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.44076380133628845},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4357782006263733},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.4342684745788574},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.43178635835647583},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.41384702920913696},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.39654776453971863},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.3914322853088379},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.381588339805603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3622114658355713},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3596395254135132},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3188783824443817},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.30691418051719666},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.26514214277267456},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.22541579604148865},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1914551854133606},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.18777123093605042},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.09912458062171936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09617897868156433}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.823925256729126},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7336426973342896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6343163847923279},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6262027621269226},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.6023918986320496},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5111656785011292},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5016179084777832},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.49012240767478943},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4819328784942627},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4620024859905243},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.44076380133628845},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4357782006263733},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.4342684745788574},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.43178635835647583},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.41384702920913696},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.39654776453971863},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3914322853088379},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.381588339805603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3622114658355713},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3596395254135132},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3188783824443817},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.30691418051719666},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.26514214277267456},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.22541579604148865},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1914551854133606},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.18777123093605042},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.09912458062171936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09617897868156433}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00236-009-0104-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-009-0104-9","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W85609108","https://openalex.org/W156540454","https://openalex.org/W206883500","https://openalex.org/W658337295","https://openalex.org/W1491178396","https://openalex.org/W1493125346","https://openalex.org/W1496038746","https://openalex.org/W1500334348","https://openalex.org/W1584587517","https://openalex.org/W1585183691","https://openalex.org/W1593799327","https://openalex.org/W1768003599","https://openalex.org/W1981565634","https://openalex.org/W1984007424","https://openalex.org/W2002089154","https://openalex.org/W2003250112","https://openalex.org/W2008108645","https://openalex.org/W2062944884","https://openalex.org/W2074048601","https://openalex.org/W2108769896","https://openalex.org/W2109507516","https://openalex.org/W2118249151","https://openalex.org/W2136285318","https://openalex.org/W2140319468","https://openalex.org/W2151033407","https://openalex.org/W2156576708","https://openalex.org/W2162310026","https://openalex.org/W2163756016","https://openalex.org/W2329957581","https://openalex.org/W2421250929","https://openalex.org/W2495873699","https://openalex.org/W2505808102","https://openalex.org/W2911295106","https://openalex.org/W3004316008","https://openalex.org/W3037477934","https://openalex.org/W4211152277","https://openalex.org/W4302339081"],"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":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}