{"id":"https://openalex.org/W2034043434","doi":"https://doi.org/10.1080/00207169908804789","title":"Prefix pushdown automata and their simplification","display_name":"Prefix pushdown automata and their simplification","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2034043434","doi":"https://doi.org/10.1080/00207169908804789","mag":"2034043434"},"language":"en","primary_location":{"id":"doi:10.1080/00207169908804789","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804789","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5009693719","display_name":"Alexander Meduna","orcid":"https://orcid.org/0000-0002-2341-0606"},"institutions":[{"id":"https://openalex.org/I4210143490","display_name":"Computing Center","ror":"https://ror.org/0557kgc34","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210143490","https://openalex.org/I4210148470"]},{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ","RU"],"is_corresponding":true,"raw_author_name":"Alexander Meduna","raw_affiliation_strings":["Computing Center at Technical University of Brno , Brno, 60200"],"affiliations":[{"raw_affiliation_string":"Computing Center at Technical University of Brno , Brno, 60200","institution_ids":["https://openalex.org/I60587646","https://openalex.org/I4210143490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009693719"],"corresponding_institution_ids":["https://openalex.org/I4210143490","https://openalex.org/I60587646"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07571412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"71","issue":"1","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973999857902527,"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.8888108730316162},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8266639709472656},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.7865642309188843},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7545336484909058},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5677683353424072},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5326231122016907},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.522604763507843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5090581774711609},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.47545477747917175},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.458364337682724},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.42981356382369995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42849215865135193},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.41183534264564514},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.37115710973739624},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36344170570373535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3120654821395874},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26406043767929077},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2131633758544922},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.1742158830165863},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.16222286224365234},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14722642302513123},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.1054815948009491},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.07327145338058472},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.06117311120033264},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.06101495027542114},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05301937460899353}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8888108730316162},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8266639709472656},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.7865642309188843},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7545336484909058},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5677683353424072},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5326231122016907},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.522604763507843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5090581774711609},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.47545477747917175},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.458364337682724},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.42981356382369995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42849215865135193},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.41183534264564514},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.37115710973739624},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36344170570373535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3120654821395874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26406043767929077},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2131633758544922},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.1742158830165863},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.16222286224365234},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14722642302513123},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.1054815948009491},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.07327145338058472},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.06117311120033264},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.06101495027542114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05301937460899353},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169908804789","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804789","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W24923559","https://openalex.org/W128159330","https://openalex.org/W194034359","https://openalex.org/W1515624550","https://openalex.org/W1723192859","https://openalex.org/W1966543618","https://openalex.org/W2062841770","https://openalex.org/W2068931825","https://openalex.org/W2074869001","https://openalex.org/W2082425717","https://openalex.org/W2167047250","https://openalex.org/W2473180978","https://openalex.org/W4242070626"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W1602383402","https://openalex.org/W2089141720","https://openalex.org/W1511257926","https://openalex.org/W2522490152","https://openalex.org/W127918926","https://openalex.org/W2116448069","https://openalex.org/W2171067235"],"abstract_inverted_index":{"A":[0],"prefix":[1,50,58,105],"pushdown":[2,51,83,106],"automatonM,":[3,52],"accepts":[4,62],"a":[5,10,18,31,45,49],"wordx,":[6],"with":[7,63],"respect":[8,64],"to":[9,65],"languageZ,":[11,47],"if":[12,15],"and":[13,29,48,84,89],"only":[14],"M":[16,61],"makes":[17],"sequence":[19],"of":[20,79,104,114],"moves":[21],"so":[22,53],"it":[23,109],"reads":[24],"xy,":[25],"for":[26,38,100],"some":[27,101],"y\u220aZ,":[28],"enters":[30],"final":[32,71,87],"state.":[33],"This":[34],"paper":[35,96],"demonstrates":[36,97],"that":[37,54,60],"every":[39],"recursively":[40],"enumerable":[41],"languageL,":[42],"there":[43],"exist":[44],"linear":[46],"L":[55],"equals":[56],"the":[57,68,94,111],"language":[59],"Z.":[66],"Besides":[67],"acceptance":[69,80,85],"by":[70,81,86],"state,":[72],"this":[73,98],"result":[74,99],"is":[75],"established":[76],"in":[77],"terms":[78],"empty":[82,90],"state":[88],"pushdown.":[91],"In":[92],"addition,":[93],"present":[95],"simplified":[102],"versions":[103],"automata.":[107],"Finally,":[108],"discusses":[110],"descriptional":[112],"complexity":[113],"these":[115],"automata":[116]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}