{"doi":"10.1007/11513988_36","title":"Efficient Monitoring of ω-Languages","abstract":null,"journal":"Lecture Notes in Computer Science","year":2005,"id":599382,"datarank":0.6646225198264971,"base_score":4.430816798843313,"endowment":4.430816798843313,"self_citation_contribution":0.6646225198264971,"citation_network_contribution":0.0,"self_endowment_contribution":0.6646225198264971,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":83,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1536125,"name":"Grigore Roşu","orcid":null,"position":1,"is_corresponding":false},{"id":1536124,"name":"Marcelo d’Amorim","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Efficient Monitoring of ω-Languages","abstract":null,"is_dataset_classified":null,"base_score":4.430816798843313,"endowment":4.430816798843313,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"23304386","pmcid":null,"openalex_id":"https://openalex.org/W2116593309","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2012,"count":8},{"year":2013,"count":10},{"year":2014,"count":5},{"year":2015,"count":2},{"year":2016,"count":2},{"year":2017,"count":3},{"year":2018,"count":6},{"year":2019,"count":4},{"year":2020,"count":5},{"year":2021,"count":4},{"year":2022,"count":1},{"year":2023,"count":1},{"year":2024,"count":2},{"year":2025,"count":1}],"oa_status":"bronze","license":null,"oa_locations":[{"url":"https://link.springer.com/content/pdf/10.1007/11513988_36.pdf","host_type":"book series"},{"url":"https://link.springer.com/content/pdf/10.1007/11513988_36.pdf","host_type":"publisher"},{"url":"http://link.springer.com/content/pdf/10.1007/11513988_36.pdf","host_type":"publisher"},{"url":"https://doi.org/10.1007/11513988_36","host_type":"book series"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.4849","host_type":""}],"fields_of_study":["Formal Methods in Verification","semigroups and automata theory","Machine Learning and Algorithms"],"mesh_terms":[],"keywords":["Computer science","Finite-state machine","Nondeterministic algorithm","Deterministic finite automaton","Prefix","Nondeterministic finite automaton","Automaton","Finite state","Regular language","Programming language","Theoretical computer science","State (computer science)","Tree (set theory)","Algorithm","Automata theory","Mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-29T02:27:49.939814Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}