{"id":"https://openalex.org/W3167021912","doi":"https://doi.org/10.1145/3406325.3465353","title":"A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)","display_name":"A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3167021912","doi":"https://doi.org/10.1145/3406325.3465353","mag":"3167021912"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3465353","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3465353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5011691423","display_name":"Marcelo Arenas","orcid":"https://orcid.org/0000-0003-3678-1868"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcelo Arenas","raw_affiliation_strings":["PUC, Chile / IMFD, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PUC, Chile / IMFD, Chile","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065267206","display_name":"Luis Alberto Croquevielle","orcid":"https://orcid.org/0009-0002-0101-4431"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luis Alberto Croquevielle","raw_affiliation_strings":["PUC, Chile / IMFD, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PUC, Chile / IMFD, Chile","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048454802","display_name":"Rajesh Jayaram","orcid":"https://orcid.org/0000-0003-0332-6332"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajesh Jayaram","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083030983","display_name":"Cristian Riveros","orcid":"https://orcid.org/0000-0003-0832-116X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cristian Riveros","raw_affiliation_strings":["PUC, Chile / IMFD, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PUC, Chile / IMFD, Chile","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10207337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.996399998664856,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9948999881744385,"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/computer-science","display_name":"Computer science","score":0.7062416672706604},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6124483942985535},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5926661491394043},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.5673999190330505},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5166869163513184},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46079450845718384},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4438271224498749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44285085797309875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4215904474258423}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7062416672706604},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6124483942985535},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5926661491394043},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.5673999190330505},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5166869163513184},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46079450845718384},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4438271224498749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44285085797309875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4215904474258423},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3465353","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3465353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2948686875"],"related_works":["https://openalex.org/W2405367651","https://openalex.org/W4300653329","https://openalex.org/W3195897816","https://openalex.org/W2133625193","https://openalex.org/W2951744172","https://openalex.org/W2767824041","https://openalex.org/W4310609870","https://openalex.org/W2061042466","https://openalex.org/W4388093093","https://openalex.org/W1979106445"],"abstract_inverted_index":{"Counting":[0],"the":[1],"number":[2],"of":[3,5],"words":[4,41],"a":[6,11,17,47,58],"certain":[7],"length":[8],"accepted":[9],"by":[10],"non-deterministic":[12],"finite":[13],"automaton":[14],"(NFA)":[15],"is":[16,45,57],"fundamental":[18],"problem,":[19,49],"which":[20],"has":[21],"many":[22],"applications":[23],"in":[24,51],"different":[25],"areas":[26],"such":[27,40],"as":[28],"graph":[29],"databases,":[30],"knowledge":[31],"compilation,":[32],"and":[33],"information":[34],"extraction.":[35],"Along":[36],"with":[37],"this,":[38],"generating":[39],"uniformly":[42],"at":[43],"random":[44],"also":[46],"relevant":[48],"particularly":[50],"scenarios":[52],"where":[53],"returning":[54],"varied":[55],"outputs":[56],"desirable":[59],"feature.":[60]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}