{"id":"https://openalex.org/W2070934866","doi":"https://doi.org/10.1142/s0129054110007532","title":"FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT","display_name":"FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2070934866","doi":"https://doi.org/10.1142/s0129054110007532","mag":"2070934866"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054110007532","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007532","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/A5103219563","display_name":"Michael Kaminski","orcid":"https://orcid.org/0000-0002-9848-4191"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"MICHAEL KAMINSKI","raw_affiliation_strings":["Department of Computer Science, Technion \u2013 Israel Institute of Technology, Haifa 32000, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion \u2013 Israel Institute of Technology, Haifa 32000, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076081268","display_name":"Daniel Zeitlin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"DANIEL ZEITLIN","raw_affiliation_strings":["Eternix Ltd., Azrieli Center, Round Tower, P.O.B. 65361, Tel Aviv 61653, Israel"],"affiliations":[{"raw_affiliation_string":"Eternix Ltd., Azrieli Center, Round Tower, P.O.B. 65361, Tel Aviv 61653, Israel","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103219563"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":2.6762,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.89858326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"21","issue":"05","first_page":"741","last_page":"760"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9976999759674072,"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/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7427011728286743},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7070320844650269},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6881150603294373},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6702879667282104},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.640959620475769},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.6239899396896362},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6094887256622314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5979486107826233},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5122012495994568},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4973497688770294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4711274802684784},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.4698072075843811},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4667613208293915},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4451707601547241},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.402058482170105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32445424795150757},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3183019757270813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31491735577583313},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1501428186893463}],"concepts":[{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7427011728286743},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7070320844650269},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6881150603294373},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6702879667282104},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.640959620475769},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.6239899396896362},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6094887256622314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5979486107826233},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5122012495994568},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4973497688770294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4711274802684784},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.4698072075843811},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4667613208293915},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4451707601547241},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.402058482170105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32445424795150757},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3183019757270813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31491735577583313},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1501428186893463},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054110007532","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007532","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1518813712","https://openalex.org/W1569718229","https://openalex.org/W1594719668","https://openalex.org/W1712879069","https://openalex.org/W1994458424","https://openalex.org/W2038404317","https://openalex.org/W2056665285","https://openalex.org/W2081396910","https://openalex.org/W2116509046","https://openalex.org/W4405645173"],"related_works":["https://openalex.org/W4205935260","https://openalex.org/W2537940722","https://openalex.org/W2037872771","https://openalex.org/W2368684504","https://openalex.org/W1987608226","https://openalex.org/W1973436632","https://openalex.org/W2462239665","https://openalex.org/W2124370744","https://openalex.org/W2057386223","https://openalex.org/W2063230375"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"extend":[4],"finite-memory":[5],"automata":[6],"with":[7],"non-deterministic":[8],"reassignment":[9],"that":[10],"allows":[11],"an":[12,32],"automaton":[13],"to":[14],"\"guess\"":[15],"the":[16,24],"future":[17],"content":[18],"of":[19,27],"its":[20],"registers,":[21],"and":[22],"introduce":[23],"corresponding":[25],"notion":[26],"a":[28],"regular":[29],"expression":[30],"over":[31],"infinite":[33],"alphabet.":[34]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}