{"id":"https://openalex.org/W6963888364","doi":"https://doi.org/10.25596/jalc-2004-281","title":"Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata","display_name":"Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W6963888364","doi":"https://doi.org/10.25596/jalc-2004-281"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2004-281","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-281","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2004-281","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kappes, Martin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kappes, Martin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Kintala, Chandra M. R.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kintala, Chandra M. R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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.45731839,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5055000185966492,"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/T10142","display_name":"Formal Methods in Verification","score":0.5055000185966492,"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/T11567","display_name":"semigroups and automata theory","score":0.35839998722076416,"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.04320000112056732,"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/reliability","display_name":"Reliability (semiconductor)","score":0.7443000078201294},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5370000004768372},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.47749999165534973},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.46779999136924744},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4602999985218048},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3873000144958496},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.36730000376701355}],"concepts":[{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.7443000078201294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6317999958992004},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5370000004768372},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47780001163482666},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.47749999165534973},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.46779999136924744},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4602999985218048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.447299987077713},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.36730000376701355},{"id":"https://openalex.org/C201729545","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability theory","level":3,"score":0.35690000653266907},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3515999913215637},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34150001406669617},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32820001244544983},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.299699991941452},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.2962999939918518},{"id":"https://openalex.org/C200601418","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability engineering","level":1,"score":0.2818000018596649},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.25850000977516174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-2004-281","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-281","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2004-281","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-281","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,50,112],"paper,":[2],"we":[3,52,93],"propose":[4],"a":[5,15,19,63,67,97,103],"model":[6],"for":[7,31,96,123],"measuring":[8],"the":[9,12,25,36,41,55,58,79,120,124],"reliability":[10,26,106],"of":[11,14,60,90,105],"description":[13,110],"language":[16,42],"L":[17],"by":[18,45,74],"deterministic":[20],"finite":[21],"automaton":[22],"M.":[23],"Intuitively,":[24],"$M$":[27,46],"exhibits":[28],"when":[29],"used":[30],"$L$":[32,39],"is":[33,47,102,114],"high":[34],"if":[35,78],"\"difference\"":[37],"between":[38,62],"and":[40,66],"$T(M)$":[43],"accepted":[44],"small.":[48],"Using":[49],"model,":[51],"prove":[53],"that":[54,108],"savings":[56],"in":[57],"number":[59],"states":[61],"fully":[64],"reliable":[65,69],"less":[68],"representation":[70],"cannot":[71],"be":[72],"bounded":[73],"any":[75,86,109],"function,":[76],"even":[77],"unreliable":[80],"descriptions":[81],"are":[82],"required":[83],"to":[84],"exceed":[85],"given":[87],"fixed":[88],"level":[89,104,113],"reliability.":[91],"Furthermore,":[92],"show":[94],"that,":[95],"single":[98],"regular":[99],"language,":[100],"there":[101],"such":[107],"exceeding":[111],"at":[115],"least":[116],"as":[117,119],"big":[118],"smallest":[121],"DFA":[122],"language.":[125]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}