{"id":"https://openalex.org/W4231358735","doi":"https://doi.org/10.1142/s0129054116400062","title":"Set Automata","display_name":"Set Automata","publication_year":2016,"publication_date":"2016-02-01","ids":{"openalex":"https://openalex.org/W4231358735","doi":"https://doi.org/10.1142/s0129054116400062"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054116400062","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116400062","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/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","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, Arndtstrasse 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, 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":"University of Giessen","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, Arndtstrasse 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083635884","display_name":"Matthias Wendlandt","orcid":"https://orcid.org/0009-0001-2243-549X"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Wendlandt","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, 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":null,"apc_paid":null,"fwci":1.7424,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.8724053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"02","first_page":"187","last_page":"214"},"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.9979000091552734,"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.9969000220298767,"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-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6559083461761475},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.6393809914588928},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.6188571453094482},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6178106069564819},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5828915238380432},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.573913037776947},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5437889695167542},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5382715463638306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5321808457374573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5165006518363953},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4812762141227722},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4484604597091675},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.44359642267227173},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4277823269367218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3699786067008972},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.29092520475387573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26431792974472046},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2484455108642578}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6559083461761475},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.6393809914588928},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.6188571453094482},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6178106069564819},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5828915238380432},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.573913037776947},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5437889695167542},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5382715463638306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5321808457374573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5165006518363953},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4812762141227722},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4484604597091675},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.44359642267227173},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4277823269367218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3699786067008972},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.29092520475387573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26431792974472046},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2484455108642578}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054116400062","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116400062","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":9,"referenced_works":["https://openalex.org/W1971153162","https://openalex.org/W1982449618","https://openalex.org/W1999147218","https://openalex.org/W2013651986","https://openalex.org/W2040713190","https://openalex.org/W2048052050","https://openalex.org/W2064465758","https://openalex.org/W2079601390","https://openalex.org/W2111753126"],"related_works":["https://openalex.org/W2037872771","https://openalex.org/W185868636","https://openalex.org/W1501943875","https://openalex.org/W2030569822","https://openalex.org/W2371400076","https://openalex.org/W2462239665","https://openalex.org/W1987608226","https://openalex.org/W2395599602","https://openalex.org/W1490895920","https://openalex.org/W2063230375"],"abstract_inverted_index":{"We":[0,48],"consider":[1],"the":[2,27,30,34,39,46,50,59,64,77,88,121,132,179],"model":[3,105],"of":[4,32,36,53,69,110,123,135,181],"deterministic":[5,11,54,98,136,149,158],"set":[6,17,28,55,99,139,150,203],"automata":[7,13,56,100,140,204],"which":[8,163],"are":[9,29,129,205],"basically":[10],"finite":[12,159],"equipped":[14],"with":[15,63],"a":[16,107,148,153,157,166,186],"as":[18,118,120],"an":[19,42,103],"additional":[20],"storage":[21],"medium.":[22],"The":[23],"basic":[24],"operations":[25],"on":[26],"insertion":[31],"elements,":[33,37],"removing":[35],"and":[38,57,67,127,137],"test":[40],"whether":[41],"element":[43],"is":[44,83,141,161,173],"in":[45,178],"set.":[47],"investigate":[49],"computational":[51],"power":[52],"compare":[58],"language":[60,155],"class":[61],"accepted":[62,71],"context-free":[65],"languages":[66,70],"classes":[68,81],"by":[72,112,183],"queue":[73],"automata.":[74],"As":[75],"result":[76],"incomparability":[78],"to":[79,165,175,193],"all":[80],"considered":[82],"obtained.":[84],"Furthermore,":[85],"we":[86,95,197],"examine":[87],"closure":[89],"properties":[90],"under":[91],"several":[92],"operations.":[93],"Then":[94],"show":[96],"that":[97,114,146],"may":[101],"be":[102,176],"interesting":[104],"from":[106],"practical":[108],"point":[109],"view":[111],"proving":[113],"their":[115],"regularity":[116],"problem":[117],"well":[119],"problems":[122],"emptiness,":[124],"finiteness,":[125],"infiniteness,":[126],"universality":[128],"decidable.":[130],"Finally,":[131],"descriptional":[133],"complexity":[134],"nondeterministic":[138,202],"investigated.":[142],"A":[143],"conversion":[144],"procedure":[145],"turns":[147],"automaton":[151,160],"accepting":[152],"regular":[154],"into":[156],"developed":[162],"leads":[164],"double":[167,187],"exponential":[168,188],"upper":[169],"bound.":[170,190],"This":[171],"bound":[172],"proved":[174],"tight":[177],"order":[180],"magnitude":[182],"presenting":[184],"also":[185],"lower":[189],"In":[191],"contrast":[192],"these":[194],"recursive":[195],"bounds":[196],"obtain":[198],"non-recursive":[199],"trade-offs":[200],"when":[201],"considered.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-05-12T00:00:00"}