{"id":"https://openalex.org/W7166365231","doi":"https://doi.org/10.4204/eptcs.446.5","title":"On some Open Problems for Finite Automata with Translucent Input Letters","display_name":"On some Open Problems for Finite Automata with Translucent Input Letters","publication_year":2026,"publication_date":"2026-06-25","ids":{"openalex":"https://openalex.org/W7166365231","doi":"https://doi.org/10.4204/eptcs.446.5"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.446.5","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.446.5","pdf_url":null,"source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.4204/eptcs.446.5","any_repository_has_fulltext":true},"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"]},{"id":"https://openalex.org/I4210148049","display_name":"Giessen School of Theology","ror":"https://ror.org/03kzgcv48","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210148049"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Kutrib","raw_affiliation_strings":["University of Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Giessen, Germany","institution_ids":["https://openalex.org/I200763008","https://openalex.org/I4210148049"]}]},{"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"]},{"id":"https://openalex.org/I4210148049","display_name":"Giessen School of Theology","ror":"https://ror.org/03kzgcv48","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210148049"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Malcher","raw_affiliation_strings":["University of Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Giessen, Germany","institution_ids":["https://openalex.org/I200763008","https://openalex.org/I4210148049"]}]},{"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":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]},{"id":"https://openalex.org/I4210148049","display_name":"Giessen School of Theology","ror":"https://ror.org/03kzgcv48","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210148049"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Wendlandt","raw_affiliation_strings":["University of Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Giessen, Germany","institution_ids":["https://openalex.org/I200763008","https://openalex.org/I4210148049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67343042,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"446","issue":null,"first_page":"73","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7246000170707703,"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.7246000170707703,"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.19089999794960022,"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.04039999842643738,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7760999798774719},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6740000247955322},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6079000234603882},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6013000011444092},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5848000049591064},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5745000243186951},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.49970000982284546},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4756999909877777},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4323999881744385}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7760999798774719},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6740000247955322},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6079000234603882},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6013000011444092},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5848000049591064},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5745000243186951},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.49970000982284546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4839000105857849},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4756999909877777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45899999141693115},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4323999881744385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4275999963283539},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4154999852180481},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4113999903202057},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.40230000019073486},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.367900013923645},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.36010000109672546},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3156000077724457},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.2976999878883362},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.28209999203681946},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2750999927520752},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.260699987411499},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.25279998779296875}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4204/eptcs.446.5","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.446.5","pdf_url":null,"source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2606.26683","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2606.26683","pdf_url":"https://arxiv.org/pdf/2606.26683","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.4204/eptcs.446.5","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.446.5","pdf_url":null,"source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Finite":[0],"automata":[1,17,112,238],"with":[2,20,113,239],"translucent":[3,33,40,114,240],"input":[4,12,34,81,102,241],"letters":[5,115,242],"are":[6,18,42,48,153],"a":[7,21],"recent":[8],"model":[9],"of":[10,32,79,100,188,247,252],"discontinuous":[11],"processing.":[13],"Basically,":[14],"classical":[15],"finite":[16,111,237],"equipped":[19],"translucency":[22],"function":[23],"that":[24],"defines,":[25],"depending":[26],"on":[27,158],"the":[28,30,38,69,72,76,80,90,93,97,101,104,137,196,207,223,232,245,248],"state,":[29],"set":[31],"symbols.":[35],"While":[36],"processing":[37],"input,":[39],"symbols":[41,47],"skipped":[43],"and":[44,50,57,65,121,123,132,143,146,150,161,203,226,243],"only":[45],"visible":[46,86],"read":[49],"processed.":[51],"It":[52],"is":[53,108],"distinguished":[54],"between":[55,63,141,148],"deterministic":[56,142,209,225,253],"nondeterministic":[58,144,213,227,257],"models":[59,152],"and,":[60],"in":[61,89,250],"addition,":[62],"returning":[64,149,224],"non-returning":[66,125,151,208,236],"models.":[67],"In":[68,179,192],"former":[70],"case,":[71],"automaton":[73,94],"restarts":[74,95],"from":[75,96],"left":[77,98],"end":[78,99],"after":[82],"having":[83],"consumed":[84],"some":[85,156,170,187],"symbol,":[87],"whereas":[88],"latter":[91],"case":[92,251],"when":[103],"right":[105],"endmarker":[106],"symbol":[107],"seen.":[109],"Returning":[110],"have":[116,164,172],"been":[117,128,165,174],"introduced":[118,129],"by":[119,130],"Nagy":[120],"Otto":[122],"its":[124],"variant":[126],"has":[127],"Mraz":[131],"Otto.":[133],"Many":[134],"results":[135,157],"concerning":[136],"computational":[138],"capacity,":[139],"relations":[140,147],"models,":[145],"known.":[154],"Moreover,":[155],"closure":[159],"properties":[160],"decidability":[162,246],"questions":[163,171],"obtained":[166],"as":[167,210,212,254,256],"well.":[168],"However,":[169],"still":[173],"open":[175,190],"since":[176],"many":[177],"years.":[178],"this":[180],"paper,":[181],"we":[182,194,230],"will":[183],"give":[184],"answers":[185],"to":[186],"these":[189],"questions.":[191],"particular,":[193],"show":[195,244],"non-closure":[197,218],"under":[198,219],"concatenation,":[199],"Kleene":[200],"star,":[201],"reversal,":[202],"inverse":[204,220],"homomorphism":[205,221],"for":[206,222,235],"well":[211,255],"model.":[214,228],"We":[215],"also":[216],"obtain":[217],"Finally,":[229],"investigate":[231],"emptiness":[233],"problem":[234,249],"automata.":[258]},"counts_by_year":[],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2026-06-28T00:00:00"}