{"id":"https://openalex.org/W2047110092","doi":"https://doi.org/10.1142/s0129054105003790","title":"ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON","display_name":"ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2047110092","doi":"https://doi.org/10.1142/s0129054105003790","mag":"2047110092"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003790","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003790","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/A5111844760","display_name":"Jean-Marc Champarnaud","orcid":null},"institutions":[{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"J.-M. CHAMPARNAUD","raw_affiliation_strings":["LIFAR,  University of Rouen, France","LIFAR, University of Rouen, France"],"affiliations":[{"raw_affiliation_string":"LIFAR,  University of Rouen, France","institution_ids":["https://openalex.org/I62396329"]},{"raw_affiliation_string":"LIFAR, University of Rouen, France","institution_ids":["https://openalex.org/I62396329"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046613667","display_name":"Fabien Coulon","orcid":null},"institutions":[{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"F. COULON","raw_affiliation_strings":["LIFAR,  University of Rouen, France","LIFAR, University of Rouen, France"],"affiliations":[{"raw_affiliation_string":"LIFAR,  University of Rouen, France","institution_ids":["https://openalex.org/I62396329"]},{"raw_affiliation_string":"LIFAR, University of Rouen, France","institution_ids":["https://openalex.org/I62396329"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111844760"],"corresponding_institution_ids":["https://openalex.org/I62396329"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13935167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"06","first_page":"1253","last_page":"1266"},"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.9962000250816345,"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/T10911","display_name":"Chemical Synthesis and Analysis","score":0.993399977684021,"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/deterministic-automaton","display_name":"Deterministic automaton","score":0.7317575812339783},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.7082045078277588},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.6876146197319031},{"id":"https://openalex.org/keywords/surjective-function","display_name":"Surjective function","score":0.6364197731018066},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6233439445495605},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.6152670979499817},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5685054063796997},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5149117708206177},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5125536918640137},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5075613260269165},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.48164644837379456},{"id":"https://openalex.org/keywords/morphism","display_name":"Morphism","score":0.45549166202545166},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4502533972263336},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.446618914604187},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4413910508155823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37847191095352173},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3550368845462799},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.3434959053993225},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28296181559562683},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10006055235862732},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07155650854110718}],"concepts":[{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.7317575812339783},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.7082045078277588},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.6876146197319031},{"id":"https://openalex.org/C119238805","wikidata":"https://www.wikidata.org/wiki/Q229102","display_name":"Surjective function","level":2,"score":0.6364197731018066},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6233439445495605},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.6152670979499817},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5685054063796997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5149117708206177},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5125536918640137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5075613260269165},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.48164644837379456},{"id":"https://openalex.org/C137212723","wikidata":"https://www.wikidata.org/wiki/Q1948412","display_name":"Morphism","level":2,"score":0.45549166202545166},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4502533972263336},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.446618914604187},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4413910508155823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37847191095352173},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3550368845462799},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.3434959053993225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28296181559562683},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10006055235862732},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07155650854110718}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054105003790","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003790","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W122920432","https://openalex.org/W1503739124","https://openalex.org/W1556566737","https://openalex.org/W2040834199","https://openalex.org/W2061668791","https://openalex.org/W2103411461","https://openalex.org/W2116509046","https://openalex.org/W3134257814","https://openalex.org/W4211010176","https://openalex.org/W6601549245"],"related_works":["https://openalex.org/W2037872771","https://openalex.org/W2243509623","https://openalex.org/W2499762659","https://openalex.org/W3153637812","https://openalex.org/W4231063068","https://openalex.org/W2139519154","https://openalex.org/W9554130","https://openalex.org/W2462239665","https://openalex.org/W1982810737","https://openalex.org/W2171527505"],"abstract_inverted_index":{"Our":[0,97],"aim":[1],"is":[2,56,92,121,133],"to":[3,41,78,123,139],"enumerate":[4],"all":[5],"NFAs":[6],"(nondeterministic":[7],"finite":[8],"automata)":[9],"that":[10,29,53,60],"recognize":[11],"a":[12,23,57,70,108],"given":[13],"regular":[14],"language":[15],"[Formula:":[16,34],"see":[17,35],"text].":[18],"More":[19],"precisely,":[20],"we":[21],"produce":[22],"set":[24],"\ud835\udd38":[25,39],"of":[26,44,50,66,81,87,95,111,114],"automata":[27],"such":[28],"each":[30],"automaton":[31,65,116,126],"A":[32,62],"recognizing":[33],"text]":[36],"appears":[37],"in":[38],"up":[40],"the":[42,48,93,115,124,140],"merging":[43],"some":[45,51],"states":[46],"and":[47,83,86,145],"addition":[49],"transitions,":[52],"is,":[54],"there":[55],"surjective":[58],"morphism":[59,76],"maps":[61],"onto":[63],"an":[64],"\ud835\udd38.":[67],"We":[68],"provide":[69],"common":[71],"theoretical":[72],"framework,":[73],"based":[74,134],"on":[75,135],"properties,":[77],"previous":[79],"works":[80],"Kameda":[82],"Weiner":[84],"(1970),":[85],"Sengoku":[88],"(1992),":[89],"whose":[90],"issue":[91],"minimization":[94],"NFAs.":[96],"paper":[98],"gives":[99],"two":[100],"incomparable":[101],"enumeration":[102],"techniques.":[103],"Both":[104],"proceed":[105],"by":[106,128],"enumerating":[107],"specific":[109],"class":[110],"grid":[112,143],"covers":[113,144],"map.":[117],"The":[118,130],"first":[119],"one":[120,132],"related":[122,138],"canonical":[125],"introduced":[127],"Carrez.":[129],"second":[131],"new":[136],"outcomes":[137],"relationship":[141],"between":[142],"their":[146],"projections.":[147]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}