{"id":"https://openalex.org/W3174967760","doi":"https://doi.org/10.1109/lics52264.2021.9470688","title":"From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata","display_name":"From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata","publication_year":2021,"publication_date":"2021-06-29","ids":{"openalex":"https://openalex.org/W3174967760","doi":"https://doi.org/10.1109/lics52264.2021.9470688","mag":"3174967760"},"language":"en","primary_location":{"id":"doi:10.1109/lics52264.2021.9470688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-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/A5087845945","display_name":"Elisabet Burjons","orcid":"https://orcid.org/0000-0001-6161-7440"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Elisabet Burjons","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027072512","display_name":"Fabian Frei","orcid":"https://orcid.org/0000-0002-1368-3205"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabian Frei","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020812040","display_name":"Martin Raszyk","orcid":"https://orcid.org/0000-0003-3018-2557"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Martin Raszyk","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087845945"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11633389,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"13"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9973000288009644,"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.992900013923645,"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.7627583742141724},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.7281998991966248},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6858713626861572},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6558889746665955},{"id":"https://openalex.org/keywords/transducer","display_name":"Transducer","score":0.6443435549736023},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6237820386886597},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.606863260269165},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5843703150749207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5207088589668274},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.44285979866981506},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.43456557393074036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42988133430480957},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42647483944892883},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4225032329559326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39146023988723755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3749207854270935},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.28406643867492676},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2616714835166931},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2412557303905487},{"id":"https://openalex.org/keywords/acoustics","display_name":"Acoustics","score":0.08127006888389587},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07949712872505188}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7627583742141724},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.7281998991966248},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6858713626861572},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6558889746665955},{"id":"https://openalex.org/C56318395","wikidata":"https://www.wikidata.org/wiki/Q215928","display_name":"Transducer","level":2,"score":0.6443435549736023},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6237820386886597},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.606863260269165},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5843703150749207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5207088589668274},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.44285979866981506},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.43456557393074036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42988133430480957},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42647483944892883},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4225032329559326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39146023988723755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3749207854270935},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.28406643867492676},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2616714835166931},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2412557303905487},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.08127006888389587},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07949712872505188},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics52264.2021.9470688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1555579046","https://openalex.org/W1560909590","https://openalex.org/W1588627453","https://openalex.org/W1606855007","https://openalex.org/W1965306495","https://openalex.org/W1981523035","https://openalex.org/W1989382950","https://openalex.org/W2003113120","https://openalex.org/W2032744775","https://openalex.org/W2037367360","https://openalex.org/W2039192691","https://openalex.org/W2042869341","https://openalex.org/W2048052050","https://openalex.org/W2049481601","https://openalex.org/W2054801208","https://openalex.org/W2072604204","https://openalex.org/W2106192381","https://openalex.org/W2126160338","https://openalex.org/W2283017818","https://openalex.org/W2737444437","https://openalex.org/W2966364601","https://openalex.org/W3157717457","https://openalex.org/W4250846042","https://openalex.org/W6662731795","https://openalex.org/W6766523923"],"related_works":["https://openalex.org/W2810776027","https://openalex.org/W2003664089","https://openalex.org/W1983100634","https://openalex.org/W185868636","https://openalex.org/W1990283467","https://openalex.org/W2136740376","https://openalex.org/W2243509623","https://openalex.org/W2037872771","https://openalex.org/W2581079654","https://openalex.org/W63685668"],"abstract_inverted_index":{"The":[0],"question":[1],"whether":[2],"P":[3],"equals":[4],"NP":[5],"revolves":[6],"around":[7],"the":[8,24,49,55,71,77,114,117],"discrepancy":[9],"between":[10],"active":[11],"production":[12],"and":[13,30,88,112],"mere":[14],"verification":[15],"by":[16,97],"Turing":[17],"machines.":[18],"In":[19],"this":[20],"paper,":[21],"we":[22],"examine":[23],"analogous":[25],"problem":[26],"for":[27,62],"finite":[28,34,67],"transducers":[29,59,91],"automata.":[31],"Every":[32],"nondeterministic":[33,90],"transducer":[35,50],"defines":[36],"a":[37,66,98],"binary":[38],"relation":[39,78],"associating":[40],"each":[41],"input":[42,82],"word":[43],"with":[44,80],"all":[45],"output":[46,74],"words":[47,75],"that":[48,76],"can":[51,94],"successfully":[52],"produce":[53],"on":[54,70],"given":[56],"input.":[57],"Finite-valued":[58],"are":[60],"those":[61],"which":[63],"there":[64],"is":[65],"upper":[68],"bound":[69],"number":[72],"of":[73,116],"associates":[79],"every":[81],"word.":[83],"We":[84],"characterize":[85],"finite-valued,":[86],"functional,":[87],"unambiguous":[89],"whose":[92],"relations":[93],"be":[95],"verified":[96],"deterministic":[99],"two-tape":[100],"automaton,":[101],"show":[102],"how":[103],"to":[104],"construct":[105],"such":[106],"an":[107],"automaton":[108],"if":[109],"one":[110],"exists,":[111],"prove":[113],"undecidability":[115],"criterion.":[118]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}