{"id":"https://openalex.org/W2028979408","doi":"https://doi.org/10.1051/ita:2007017","title":"An upper bound for transforming self-verifying automata into deterministic ones","display_name":"An upper bound for transforming self-verifying automata into deterministic ones","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2028979408","doi":"https://doi.org/10.1051/ita:2007017","mag":"2028979408"},"language":"en","primary_location":{"id":"doi:10.1051/ita:2007017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2007017","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ita:2007017.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104360871","display_name":"Ira Assent","orcid":"https://orcid.org/0000-0002-1091-9948"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ira Assent","raw_affiliation_strings":["RWTH Aachen, Lehrstuhl f\u00fcr Informatik IX, Ahornstr. 55, 52074 Aachen, Germany; assent@informatik.rwth-aachen.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen, Lehrstuhl f\u00fcr Informatik IX, Ahornstr. 55, 52074 Aachen, Germany; assent@informatik.rwth-aachen.de","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045896053","display_name":"Sebastian Seibert","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Sebastian Seibert","raw_affiliation_strings":["ETH Z\u00fcrich, Department Informatik, Informationstechnologie und Ausbildung, ETH Zentrum, 8092 Z\u00fcrich, Switzerland; sseibert@inf.ethz.ch"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Department Informatik, Informationstechnologie und Ausbildung, ETH Zentrum, 8092 Z\u00fcrich, Switzerland; sseibert@inf.ethz.ch","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7224,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72605214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"41","issue":"3","first_page":"261","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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":0.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9966999888420105,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8231772780418396},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6726274490356445},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6521743535995483},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.6330983638763428},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5674954056739807},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.551491379737854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5259844660758972},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.44812294840812683},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.44340765476226807},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44094622135162354},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4238152503967285},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.41846922039985657},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.41365617513656616},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.381362646818161},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3723982274532318},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.3360835313796997},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3104499578475952},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29144287109375},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06604859232902527}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8231772780418396},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6726274490356445},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6521743535995483},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.6330983638763428},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5674954056739807},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.551491379737854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5259844660758972},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.44812294840812683},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.44340765476226807},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44094622135162354},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4238152503967285},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.41846922039985657},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.41365617513656616},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.381362646818161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3723982274532318},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.3360835313796997},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3104499578475952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29144287109375},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06604859232902527},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ita:2007017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2007017","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2007__41_3_261_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita:2007017/","pdf_url":"https://www.numdam.org/item/10.1051/ita:2007017.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:publications.rwth-aachen.de:155152","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/155152","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical informatics and applications = Informatique th\u00e9orique et applications 41(3), 261-265 (2007). doi:10.1051/ita:2007017","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:numdam.org:ITA_2007__41_3_261_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita:2007017/","pdf_url":"https://www.numdam.org/item/10.1051/ita:2007017.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G6319130174","display_name":"Computational power of randomization and nondeterminism","funder_award_id":"107327","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2028979408.pdf","grobid_xml":"https://content.openalex.org/works/W2028979408.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W421997344","https://openalex.org/W2002089154","https://openalex.org/W2072453354","https://openalex.org/W2090921231","https://openalex.org/W2149288970"],"related_works":["https://openalex.org/W2050073538","https://openalex.org/W2350842303","https://openalex.org/W4312258751","https://openalex.org/W2050769871","https://openalex.org/W1945859206","https://openalex.org/W1851980922","https://openalex.org/W2963458585","https://openalex.org/W1565877235","https://openalex.org/W131394547","https://openalex.org/W1490764140"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,22],"modification":[4],"of":[5,13],"the":[6,11,26],"power":[7],"set":[8,23],"construction":[9],"for":[10,29],"transformation":[12,31],"self-verifying":[14],"nondeterministic":[15],"finite":[16],"automata":[17],"to":[18,36],"deterministic":[19],"ones.":[20],"Using":[21],"counting":[24],"argument,":[25],"upper":[27],"bound":[28],"this":[30],"can":[32],"be":[33],"lowered":[34],"from":[35]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}