乐胖代购免代理版

{"id":"https://openalex.org/W2111599734","doi":"https://doi.org/10.1145/800076.802456","title":"Pushdown automata, graphs, ends, second-order logic, and reachability problems","display_name":"Pushdown automata, graphs, ends, second-order logic, and reachability problems","publication_year":1981,"publication_date":"1981-01-01","ids":{"openalex":"https://openalex.org/W2111599734","doi":"https://doi.org/10.1145/800076.802456","mag":"2111599734"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/800076.802456","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802456","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802456","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031808060","display_name":"David E. Muller","orcid":"https://orcid.org/0000-0002-5384-9644"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David E. Muller","raw_affiliation_strings":["Department of Mathematics University of Illinois, Urbana, Illinois 61801 i.","Department of Mathematics and Coordinated Science Laboratory"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Illinois, Urbana, Illinois 61801 i.","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Mathematics and Coordinated Science Laboratory","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062666692","display_name":"Paul E. Schupp","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul E. Schupp","raw_affiliation_strings":["Department of Mathematics University of Illinois, Urbana, Illinois 61801 i.","Department of Mathematics and Coordinated Science Laboratory"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Illinois, Urbana, Illinois 61801 i.","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Mathematics and Coordinated Science Laboratory","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.909,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":10,"citation_normalized_percentile":{"value":0.639456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":80,"max":81},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9976,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9976,"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/T11567","display_name":"semigroups and automata theory","score":0.9956,"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.9917,"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.7708632},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.59278375},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5320923},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.52359545},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5026648},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.48111433},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.44491944}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7708632},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.72750115},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.59278375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5481036},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5320923},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.52359545},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5229945},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5026648},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.48111433},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45221013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4470515},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.44491944},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.42473748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41288567},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.39083046},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.35130283},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.30711892},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.17045218},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.09564301},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07137361},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/800076.802456","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802456","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/800076.802456","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802456","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":7,"referenced_works":["https://openalex.org/W1551305199","https://openalex.org/W1970398023","https://openalex.org/W2002089154","https://openalex.org/W2131663704","https://openalex.org/W2162583406","https://openalex.org/W4240244556","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W4206600150","https://openalex.org/W2472752294","https://openalex.org/W2400175085","https://openalex.org/W2171067235","https://openalex.org/W214992615","https://openalex.org/W2116448069","https://openalex.org/W2089141720","https://openalex.org/W2067895928","https://openalex.org/W1486486721","https://openalex.org/W127918926"],"abstract_inverted_index":{"We":[0,38,110],"have":[1],"discovered":[2],"a":[3,44,118],"very":[4,119],"strong":[5],"connection":[6],"between":[7],"certain":[8,29],"areas":[9],"of":[10,15,48,67,84,103,122],"theoretical":[11],"computer":[12],"science\u2014the":[13],"theory":[14,66,83],"context-free":[16,53,86,142],"languages":[17],"and":[18,25,35,59,92],"pushdown":[19],"automata,":[20,24],"tiling":[21],"problems,":[22],"cellular":[23],"vector":[26,93],"addition":[27,94],"systems\u2014and":[28],"concepts":[30,41],"from":[31],"group":[32],"theory,":[33],"topology,":[34],"second-order":[36,65,82],"logic.":[37],"use":[39],"these":[40],"to":[42,77,127],"investigate":[43],"rather":[45],"wide":[46],"class":[47,121],"graphs":[49,123],"which":[50],"we":[51,74],"call":[52],"graphs.":[54,143],"Using":[55],"the":[56,63,68,80,101,128,132],"results":[57],"obtained":[58],"Rabin's":[60],"theorem":[61],"that":[62,79,112],"monadic":[64,81],"infinite":[69],"binary":[70],"tree":[71],"is":[72,88],"decidable,":[73],"are":[75,96,139],"able":[76],"show":[78,111],"any":[85],"graph":[87],"decidable.":[89],"Cellular":[90],"automata":[91],"systems":[95,114,138],"usually":[97],"considered":[98],"as":[99],"involving":[100],"grid":[102],"integer":[104],"lattice":[105],"points":[106],"in":[107,125],"n-dimensional":[108],"space.":[109],"such":[113,137],"make":[115],"sense":[116],"on":[117,141],"general":[120],"and,":[124],"contrast":[126],"classical":[129],"case,":[130],"all":[131],"relevant":[133],"algorithmic":[134],"problems":[135],"concerning":[136],"solvable":[140]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2111599734","counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2024-12-10T10:21:55.225894","created_date":"2016-06-24"}