{"id":"https://openalex.org/W4280585047","doi":"https://doi.org/10.1142/s0129054122410076","title":"Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata","display_name":"Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata","publication_year":2022,"publication_date":"2022-04-01","ids":{"openalex":"https://openalex.org/W4280585047","doi":"https://doi.org/10.1142/s0129054122410076"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054122410076","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122410076","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/A5053971567","display_name":"Laurette Marais","orcid":"https://orcid.org/0009-0000-3670-2045"},"institutions":[{"id":"https://openalex.org/I26092322","display_name":"Stellenbosch University","ror":"https://ror.org/05bk57929","country_code":"ZA","type":"education","lineage":["https://openalex.org/I26092322"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Laurette Marais","raw_affiliation_strings":["Department of Computer Science, Stellenbosch University, Stellenbosch, South Africa","Meraka Institute, CSIR, Pretoria, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stellenbosch University, Stellenbosch, South Africa","institution_ids":["https://openalex.org/I26092322"]},{"raw_affiliation_string":"Meraka Institute, CSIR, Pretoria, South Africa","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076118539","display_name":"Lynette van Zijl","orcid":"https://orcid.org/0000-0001-5735-0448"},"institutions":[{"id":"https://openalex.org/I26092322","display_name":"Stellenbosch University","ror":"https://ror.org/05bk57929","country_code":"ZA","type":"education","lineage":["https://openalex.org/I26092322"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Lynette van Zijl","raw_affiliation_strings":["Department of Computer Science, Stellenbosch University, Stellenbosch, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stellenbosch University, Stellenbosch, South Africa","institution_ids":["https://openalex.org/I26092322"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053971567"],"corresponding_institution_ids":["https://openalex.org/I26092322"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06956915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"03n04","first_page":"313","last_page":"333"},"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/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/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9977999925613403,"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/unary-operation","display_name":"Unary operation","score":0.9319441318511963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6546216011047363},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6281093955039978},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6079521179199219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5725484490394592},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5397307872772217},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5078073143959045},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4948984980583191},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4632076025009155},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.46023038029670715},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.45055627822875977},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.359058141708374},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.19489595293998718},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1640317738056183},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13086679577827454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0686003565788269}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.9319441318511963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6546216011047363},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6281093955039978},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6079521179199219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5725484490394592},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5397307872772217},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5078073143959045},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4948984980583191},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4632076025009155},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.46023038029670715},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.45055627822875977},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.359058141708374},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.19489595293998718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1640317738056183},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13086679577827454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0686003565788269},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054122410076","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122410076","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":[{"score":0.4300000071525574,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W62782445","https://openalex.org/W637101581","https://openalex.org/W1560578415","https://openalex.org/W1972814610","https://openalex.org/W1978638999","https://openalex.org/W2028979408","https://openalex.org/W2080058150","https://openalex.org/W2133978759","https://openalex.org/W2486953598","https://openalex.org/W2620768494","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1945859206","https://openalex.org/W22759520","https://openalex.org/W2772918710","https://openalex.org/W1981823970","https://openalex.org/W2095282951","https://openalex.org/W2096694877","https://openalex.org/W2488819432","https://openalex.org/W2136740376","https://openalex.org/W2037872771","https://openalex.org/W2407531803"],"abstract_inverted_index":{"Unary":[0],"self-verifying":[1,44],"symmetric":[2,45],"difference":[3,46],"automata":[4],"have":[5],"a":[6,34,42,97,107],"known":[7],"tight":[8,108],"bound":[9,109],"of":[10,100],"[Formula:":[11,29,37,50,63,72,87,103],"see":[12,30,38,51,64,73,88,104],"text]":[13,39,52,65,74,89,105],"for":[14,27,96],"their":[15],"state":[16,112],"complexity.":[17,113],"We":[18],"now":[19],"consider":[20],"the":[21,111],"non-unary":[22,43,101],"case":[23],"and":[24],"show":[25,94],"that,":[26],"every":[28],"text],":[31],"there":[32],"is":[33,77,106],"regular":[35],"language":[36],"accepted":[40],"by":[41],"nondeterministic":[47],"automaton":[48,61],"with":[49,71],"states,":[53,75],"such":[54],"that":[55,95],"its":[56],"equivalent":[57,90],"minimal":[58],"deterministic":[59],"finite":[60],"has":[62],"states.":[66],"Furthermore,":[67],"given":[68],"any":[69],"SV-XNFA":[70],"it":[76],"possible,":[78],"up":[79],"to":[80,82],"isomorphism,":[81],"find":[83],"at":[84],"most":[85],"another":[86],"SV-XNFA.":[91],"Finally,":[92],"we":[93],"certain":[98],"set":[99],"SV-XNFA,":[102],"on":[110]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}