{"id":"https://openalex.org/W2024742941","doi":"https://doi.org/10.1142/s0129054195000123","title":"A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES","display_name":"A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2024742941","doi":"https://doi.org/10.1142/s0129054195000123","mag":"2024742941"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054195000123","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054195000123","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5110824644","display_name":"Wuxu Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"WUXU PENG","raw_affiliation_strings":["Department of Computer Science, Southwest Texas State University, San Marcos, Texas 78666, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Southwest Texas State University, San Marcos, Texas 78666, U.S.A","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015651954","display_name":"S. Purushothaman Iyer","orcid":"https://orcid.org/0009-0005-9132-4389"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. PURUSHOTHAMAN IYER","raw_affiliation_strings":["Department of Computer Science, North Carolina State University, Raleigh, North Carolina 27695, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, North Carolina State University, Raleigh, North Carolina 27695, U.S.A","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15460302,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"06","issue":"02","first_page":"169","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.8022783994674683},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6526069045066833},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6364601254463196},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5677671432495117},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.5506889820098877},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5400860905647278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5199936032295227},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.49466249346733093},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4846092164516449},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4507664144039154},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.41753101348876953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3925812840461731},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3588898181915283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31376567482948303},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2989234924316406},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.2953585386276245},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.1223556399345398},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.11029398441314697},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0692884624004364}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8022783994674683},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6526069045066833},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6364601254463196},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5677671432495117},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.5506889820098877},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5400860905647278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5199936032295227},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.49466249346733093},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4846092164516449},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4507664144039154},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.41753101348876953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3925812840461731},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3588898181915283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31376567482948303},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2989234924316406},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2953585386276245},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.1223556399345398},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.11029398441314697},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0692884624004364},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"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":1,"locations":[{"id":"doi:10.1142/s0129054195000123","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054195000123","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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":0,"referenced_works":[],"related_works":["https://openalex.org/W392685101","https://openalex.org/W4231088732","https://openalex.org/W1972232894","https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W2811163417","https://openalex.org/W127918926","https://openalex.org/W214992615","https://openalex.org/W4241567000","https://openalex.org/W2171067235"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4],"pushdown":[5],"automata":[6,30,86],"on":[7,31,87],"infinite":[8,32,88],"trees":[9],"with":[10,69],"empty":[11],"stack":[12],"as":[13],"the":[14,20,50,59,82,93,96],"accepting":[15],"condition":[16],"(\u03c9-EPDTA).":[17],"We":[18,48,90],"provide":[19],"following":[21],"regarding":[22],"\u03c9-EPDTA:":[23],"(a)":[24],"its":[25],"relationship":[26],"to":[27,100],"other":[28],"Pushdown":[29],"trees,":[33],"(b)":[34],"a":[35,40,66],"Kleene-Closure":[36],"theorem":[37],"and":[38,64],"(c)":[39],"single":[41],"exponential":[42],"time":[43],"algorithm":[44],"for":[45],"checking":[46],"emptiness.":[47],"demonstrate":[49],"usefulness":[51],"of":[52,74,95],"\u03c9-EPDTA":[53],"through":[54],"two":[55],"example":[56],"applications:":[57],"defining":[58],"temporal":[60],"uniform":[61],"inevitability":[62],"property":[63],"specifying":[65],"context-free":[67],"process":[68],"unbounded":[70],"state":[71,85],"space,":[72],"both":[73],"which":[75],"cannot":[76],"be":[77],"defined":[78],"and/or":[79],"specified":[80],"by":[81],"classical":[83],"finite":[84],"trees.":[89],"also":[91],"discuss":[92],"relevance":[94],"results":[97],"presented":[98],"here":[99],"model-checking.":[101]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}