{"id":"https://openalex.org/W3165010732","doi":"https://doi.org/10.1007/s00236-021-00402-0","title":"Finite automata with undirected state graphs","display_name":"Finite automata with undirected state graphs","publication_year":2021,"publication_date":"2021-05-24","ids":{"openalex":"https://openalex.org/W3165010732","doi":"https://doi.org/10.1007/s00236-021-00402-0","mag":"3165010732"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-021-00402-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-021-00402-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-021-00402-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00236-021-00402-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Kutrib","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392, Giessen, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9564-2625","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392, Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083650443","display_name":"Andreas Malcher","orcid":"https://orcid.org/0000-0002-9589-5833"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Malcher","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392, Giessen, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9589-5833","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392, Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007701157","display_name":"Christian Schneider","orcid":"https://orcid.org/0000-0001-7231-3266"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schneider","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392, Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392, Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026803820"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09950336,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"1","first_page":"163","last_page":"181"},"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.9986000061035156,"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/T10142","display_name":"Formal Methods in Verification","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7578790783882141},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6881351470947266},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6843948364257812},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6553459167480469},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.6157841682434082},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.6094372272491455},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5864298343658447},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5818215608596802},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5634652376174927},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5400955677032471},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5068121552467346},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.493583083152771},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4918978214263916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4778537452220917},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4619472622871399},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.40343397855758667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3968079686164856},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31200528144836426},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3055204451084137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23726928234100342},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1542130708694458}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7578790783882141},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6881351470947266},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6843948364257812},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6553459167480469},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6157841682434082},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.6094372272491455},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5864298343658447},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5818215608596802},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5634652376174927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5400955677032471},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5068121552467346},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.493583083152771},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4918978214263916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4778537452220917},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4619472622871399},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.40343397855758667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3968079686164856},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31200528144836426},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3055204451084137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23726928234100342},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1542130708694458}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00236-021-00402-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-021-00402-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-021-00402-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00236-021-00402-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-021-00402-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-021-00402-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3165010732.pdf","grobid_xml":"https://content.openalex.org/works/W3165010732.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W101272661","https://openalex.org/W181055653","https://openalex.org/W1525645762","https://openalex.org/W1975307939","https://openalex.org/W2010487137","https://openalex.org/W2057841333","https://openalex.org/W2068967633","https://openalex.org/W2130741488","https://openalex.org/W2619298142","https://openalex.org/W2747254125","https://openalex.org/W2796797028","https://openalex.org/W2880510147","https://openalex.org/W2913383557","https://openalex.org/W2963175946","https://openalex.org/W2998389348","https://openalex.org/W4211010176","https://openalex.org/W4233798822"],"related_works":["https://openalex.org/W2030569822","https://openalex.org/W2079577017","https://openalex.org/W2050777932","https://openalex.org/W2083848761","https://openalex.org/W2004312423","https://openalex.org/W2772918710","https://openalex.org/W2619559442","https://openalex.org/W3186009139","https://openalex.org/W2037872771","https://openalex.org/W3165010732"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"investigate":[2],"finite":[3,72],"automata":[4,81],"whose":[5],"state":[6,17,34,92],"graphs":[7],"are":[8,49,87,114,131],"undirected.":[9],"This":[10],"means":[11],"that":[12,126],"for":[13,116],"any":[14],"transition":[15,32],"from":[16,25,33],"p":[18,37],"to":[19,36],"q":[20,35],"consuming":[21,38],"some":[22],"letter":[23,40],"a":[24,30,39,41],"the":[26,45,55,63,77,90,95,101,124,127,134],"input":[27],"there":[28],"exists":[29],"symmetric":[31],"as":[42,98,100,118,120],"well.":[43],"So,":[44],"corresponding":[46,128],"language":[47,129],"families":[48],"subregular,":[50],"and":[51,69,104,111],"in":[52,54],"particular":[53],"deterministic":[56,68],"case,":[57],"subreversible.":[58],"In":[59],"detail,":[60],"we":[61],"study":[62],"operational":[64,91],"descriptional":[65],"complexity":[66,93],"of":[67,80,94],"nondeterministic":[70],"undirected":[71],"automata.":[73],"To":[74],"this":[75],"end,":[76],"different":[78],"types":[79],"on":[82],"alphabets":[83,122],"with":[84],"few":[85],"letters":[86],"characterized.":[88],"Then,":[89],"Boolean":[96],"operations":[97,102],"well":[99,119],"concatenation":[103],"iteration":[105],"is":[106],"investigated,":[107],"where":[108],"tight":[109],"upper":[110],"lower":[112],"bounds":[113],"derived":[115],"unary":[117],"arbitrary":[121],"under":[123,133],"condition":[125],"classes":[130],"closed":[132],"operation":[135],"considered.":[136]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}