{"id":"https://openalex.org/W1810796502","doi":"https://doi.org/10.1007/978-3-540-74407-8_32","title":"Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages","display_name":"Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages","publication_year":2007,"publication_date":"2007-08-18","ids":{"openalex":"https://openalex.org/W1810796502","doi":"https://doi.org/10.1007/978-3-540-74407-8_32","mag":"1810796502"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74407-8_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74407-8_32","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/A5086034910","display_name":"Laura Bozzelli","orcid":"https://orcid.org/0000-0003-0963-8169"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Laura Bozzelli","raw_affiliation_strings":["Universit\u00e0 di Napoli Federico II , Via Cintia, 80126 - Napoli, Italy","Universit\u00e0 di Napoli Federico II, Via Cintia, Napoli, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Napoli Federico II , Via Cintia, 80126 - Napoli, Italy","institution_ids":[]},{"raw_affiliation_string":"Universit\u00e0 di Napoli Federico II, Via Cintia, Napoli, Italy#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086034910"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.7054,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.84758816,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"476","last_page":"491"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9975000023841858,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9955999851226807,"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.6485850214958191},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5783177018165588},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5669757127761841},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5035967230796814},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5022706985473633},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4888891279697418},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.43961742520332336},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4165892004966736},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.4150412380695343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33816805481910706},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.32955417037010193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3148379325866699},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3121676445007324},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.28327304124832153},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.17182296514511108},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.16698122024536133},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13232502341270447},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.11957740783691406},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.08655086159706116},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.06983327865600586}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6485850214958191},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5783177018165588},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5669757127761841},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5035967230796814},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5022706985473633},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4888891279697418},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.43961742520332336},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4165892004966736},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.4150412380695343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33816805481910706},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.32955417037010193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3148379325866699},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3121676445007324},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.28327304124832153},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.17182296514511108},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.16698122024536133},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13232502341270447},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.11957740783691406},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.08655086159706116},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.06983327865600586},{"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.1007/978-3-540-74407-8_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74407-8_32","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7699999809265137,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W260642817","https://openalex.org/W1492682035","https://openalex.org/W1556566737","https://openalex.org/W1589224558","https://openalex.org/W1589421353","https://openalex.org/W1691700263","https://openalex.org/W1725438563","https://openalex.org/W1996207810","https://openalex.org/W2076284895","https://openalex.org/W2114132089","https://openalex.org/W2119736157","https://openalex.org/W2124876285","https://openalex.org/W2135909702","https://openalex.org/W2151033407","https://openalex.org/W2152221608","https://openalex.org/W2155627592","https://openalex.org/W2155756511","https://openalex.org/W2166521230","https://openalex.org/W2488032294","https://openalex.org/W2503611065","https://openalex.org/W4205877761","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W392685101","https://openalex.org/W1511257926","https://openalex.org/W1972232894","https://openalex.org/W2067895928","https://openalex.org/W2482236631","https://openalex.org/W2522490152","https://openalex.org/W2472752294","https://openalex.org/W1930049440","https://openalex.org/W3133052492","https://openalex.org/W2064514470"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}