{"id":"https://openalex.org/W4234130960","doi":"https://doi.org/10.1142/s012905411940032x","title":"Branching Measures and Nearly Acyclic NFAs","display_name":"Branching Measures and Nearly Acyclic NFAs","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W4234130960","doi":"https://doi.org/10.1142/s012905411940032x"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411940032x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411940032x","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/A5110668534","display_name":"Chris Keeler","orcid":null},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Casey Keeler","raw_affiliation_strings":["School of Computing, Queen\u2019s University, Kingston, Ontario K7L 2N8, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u2019s University, Kingston, Ontario K7L 2N8, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009151151","display_name":"Kai Salomaa","orcid":"https://orcid.org/0000-0003-4582-7477"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kai Salomaa","raw_affiliation_strings":["School of Computing, Queen\u2019s University, Kingston, Ontario K7L 2N8, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u2019s University, Kingston, Ontario K7L 2N8, Canada","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110668534"],"corresponding_institution_ids":["https://openalex.org/I204722609"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30070252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"06n07","first_page":"1135","last_page":"1155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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/T11567","display_name":"semigroups and automata theory","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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/T12029","display_name":"DNA and Biological Computing","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6502336859703064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6137964129447937},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5516414046287537},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5475311875343323},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5095937252044678},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.48925352096557617},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4891522228717804},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47376397252082825},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4333551526069641},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4229056239128113},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.2799907326698303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20080041885375977},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1880822479724884},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.10110098123550415}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6502336859703064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6137964129447937},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5516414046287537},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5475311875343323},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5095937252044678},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.48925352096557617},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4891522228717804},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47376397252082825},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4333551526069641},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4229056239128113},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.2799907326698303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20080041885375977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1880822479724884},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.10110098123550415},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905411940032x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411940032x","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":[{"score":0.5600000023841858,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G2800178644","display_name":null,"funder_award_id":"OGP0147224","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1485181793","https://openalex.org/W1970107546","https://openalex.org/W1971747251","https://openalex.org/W1975246937","https://openalex.org/W1978033038","https://openalex.org/W1983940475","https://openalex.org/W2000290048","https://openalex.org/W2025256949","https://openalex.org/W2045761215","https://openalex.org/W2057747677","https://openalex.org/W2066768040","https://openalex.org/W2072102045","https://openalex.org/W2079577017","https://openalex.org/W2081929761","https://openalex.org/W2110214225","https://openalex.org/W2118382442","https://openalex.org/W2154178113","https://openalex.org/W2157017998","https://openalex.org/W2586374872","https://openalex.org/W2611884230","https://openalex.org/W4211010176","https://openalex.org/W4246219036","https://openalex.org/W4301344748"],"related_works":["https://openalex.org/W2790652601","https://openalex.org/W2770489137","https://openalex.org/W2143578569","https://openalex.org/W2164968206","https://openalex.org/W2538831380","https://openalex.org/W2100596986","https://openalex.org/W2170132780","https://openalex.org/W2081923730","https://openalex.org/W2009340103","https://openalex.org/W1982464584"],"abstract_inverted_index":{"To":[0],"get":[1],"a":[2,14,33,41,162],"more":[3],"comprehensive":[4],"understanding":[5],"of":[6,9,13,49,71,77,90,95,100,130,135,155,187],"the":[7,23,36,47,58,69,88,91,108,150,185],"amount":[8],"branching":[10],"in":[11],"computations":[12,52,73],"nondeterministic":[15],"finite":[16,140,151],"automaton":[17],"(NFA),":[18],"we":[19,147],"introduce":[20],"and":[21,27,57,173],"study":[22],"string":[24,37,42,101],"path":[25,29,38,60,93,102,142,153],"width":[26,30,39,61,94,103,154],"depth":[28,59,92,141,152],"measures.":[31],"For":[32],"given":[34],"NFA,":[35],"on":[40,53,62,74,111],"[Formula:":[43,54,65,79,157,163,170],"see":[44,55,66,80,158,164,171],"text]":[45,67,172],"counts":[46,68],"number":[48,70],"all":[50,75,137],"complete":[51,72],"text],":[56],"an":[63,84,96,156],"integer":[64],"strings":[76],"length":[78],"text].":[81],"We":[82],"give":[83],"algorithm":[85],"to":[86,107],"decide":[87],"finiteness":[89,99],"NFA.":[97],"Deciding":[98],"can":[104,121],"be":[105],"reduced":[106],"corresponding":[109],"question":[110],"ambiguity.":[112],"An":[113],"NFA":[114,160],"is":[115,167,177],"nearly":[116,131,180],"acyclic":[117,132,181],"if":[118],"any":[119],"computation":[120],"pass":[122],"through":[123],"at":[124,168],"most":[125,169],"one":[126],"cycle.":[127],"The":[128,179],"class":[129,186],"NFAs":[133,138,182],"consists":[134],"exactly":[136,184],"with":[139],"width.":[143],"Using":[144],"this":[145,175],"characterization":[146],"show":[148],"that":[149,174],"text]-state":[159],"over":[161],"text]-letter":[165],"alphabet":[166],"bound":[176],"tight.":[178],"recognize":[183],"constant":[188],"density":[189],"regular":[190],"languages.":[191]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}