{"id":"https://openalex.org/W2749142084","doi":"https://doi.org/10.23638/dmtcs-21-3-4","title":"Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words","display_name":"Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words","publication_year":2019,"publication_date":"2019-01-31","ids":{"openalex":"https://openalex.org/W2749142084","doi":"https://doi.org/10.23638/dmtcs-21-3-4","mag":"2749142084"},"language":"en","primary_location":{"id":"doi:10.23638/dmtcs-21-3-4","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-3-4","pdf_url":"https://dmtcs.episciences.org/5141/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dmtcs.episciences.org/5141/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021229064","display_name":"Christof L\u00f6ding","orcid":"https://orcid.org/0000-0002-1529-2806"},"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":"Christof L\u00f6ding","raw_affiliation_strings":["RWTH Aachen University"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056098347","display_name":"Christopher Spinrath","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christopher Spinrath","raw_affiliation_strings":["TU Dortmund University"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021229064"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00804992,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Vol. 21 no. 3","issue":"Automata, Logic and Semantics","first_page":null,"last_page":null},"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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/T10126","display_name":"Logic, programming, and type systems","score":0.996999979019165,"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/decidability","display_name":"Decidability","score":0.8633059859275818},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8553836345672607},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.7313427329063416},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.651410698890686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6183062791824341},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5932574272155762},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.5615609288215637},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.5545493960380554},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5481019020080566},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4858793616294861},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4839754104614258},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47237566113471985},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.46397265791893005},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4602590501308441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28144803643226624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19774854183197021}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8633059859275818},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8553836345672607},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.7313427329063416},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.651410698890686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6183062791824341},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5932574272155762},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.5615609288215637},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.5545493960380554},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5481019020080566},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4858793616294861},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4839754104614258},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47237566113471985},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.46397265791893005},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4602590501308441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28144803643226624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19774854183197021},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/dmtcs-21-3-4","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-3-4","pdf_url":"https://dmtcs.episciences.org/5141/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1803.06140","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.06140","pdf_url":"https://arxiv.org/pdf/1803.06140","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:713649","is_oa":false,"landing_page_url":"http://publications.rwth-aachen.de/search?p=id:%22RWTH-2018-01270%22","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Berlin, Heidelberg : Springer Berlin Heidelberg, Lecture Notes in Computer Science 10472, 341-354 (2017). doi:10.1007/978-3-662-55751-8_27","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.1803.06140","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1803.06140","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/dmtcs-21-3-4","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-3-4","pdf_url":"https://dmtcs.episciences.org/5141/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2749142084.pdf","grobid_xml":"https://content.openalex.org/works/W2749142084.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W104223015","https://openalex.org/W128496866","https://openalex.org/W1505482284","https://openalex.org/W1517606395","https://openalex.org/W1526786777","https://openalex.org/W1570009926","https://openalex.org/W1584451387","https://openalex.org/W1589224558","https://openalex.org/W1590283810","https://openalex.org/W1594530072","https://openalex.org/W1774334694","https://openalex.org/W1857043531","https://openalex.org/W1891022440","https://openalex.org/W1966686249","https://openalex.org/W1966974117","https://openalex.org/W1981523035","https://openalex.org/W2005456631","https://openalex.org/W2005868161","https://openalex.org/W2020663042","https://openalex.org/W2054801208","https://openalex.org/W2064465758","https://openalex.org/W2077572182","https://openalex.org/W2079601390","https://openalex.org/W2086119518","https://openalex.org/W2111270089","https://openalex.org/W2126533781","https://openalex.org/W2138856440","https://openalex.org/W2151033407","https://openalex.org/W2154229279","https://openalex.org/W2165726630","https://openalex.org/W2296095876","https://openalex.org/W2395891450","https://openalex.org/W2472752294","https://openalex.org/W2567702657","https://openalex.org/W2604798101","https://openalex.org/W2962888479","https://openalex.org/W2963249196"],"related_works":["https://openalex.org/W1598356149","https://openalex.org/W4247436880","https://openalex.org/W2378405769","https://openalex.org/W2911544256","https://openalex.org/W2752896058","https://openalex.org/W2062503615","https://openalex.org/W1503991720","https://openalex.org/W1503929941","https://openalex.org/W2064989302","https://openalex.org/W2160501251"],"abstract_inverted_index":{"We":[0,15,68],"consider":[1],"decision":[2,85],"problems":[3],"for":[4,21,55,101,154,162,166],"relations":[5,25],"over":[6,26,59],"finite":[7,13,37,77],"and":[8,79],"infinite":[9,27,60],"words":[10,28,61,78],"defined":[11],"by":[12],"automata.":[14],"prove":[16],"that":[17,47],"the":[18,34,40,74,81,84,123,126,131,167],"equivalence":[19],"problem":[20,41,72],"binary":[22],"deterministic":[23,102],"rational":[24],"is":[29,42,49,64,93,107],"undecidable":[30],"in":[31,51,73,130],"contrast":[32],"to":[33,87,118],"case":[35],"of":[36,76,83,110,122,134,142],"words,":[38],"where":[39],"decidable.":[43],"Furthermore,":[44],"we":[45],"show":[46],"it":[48,63],"decidable":[50],"doubly":[52],"exponential":[53,89],"time":[54,98],"an":[56],"automatic":[57],"relation":[58],"whether":[62],"a":[65,96,108],"recognizable":[66],"relation.":[67],"also":[69],"revisit":[70],"this":[71],"context":[75],"improve":[80],"complexity":[82,164],"procedure":[86,92],"single":[88],"time.":[90],"The":[91],"based":[94],"on":[95],"polynomial":[97],"regularity":[99],"test":[100],"visibly":[103],"pushdown":[104],"automata,":[105],"which":[106],"result":[109],"independent":[111],"interest.":[112],"Comment:":[113],"v1:":[114],"31":[115],"pages,":[116,139,151,159,172],"submitted":[117],"DMTCS,":[119],"extended":[120],"version":[121],"paper":[124],"with":[125],"same":[127],"title":[128],"published":[129],"conference":[132],"proceedings":[133],"FCT":[135],"2017;":[136],"v2:":[137],"32":[138,150,158,171],"minor":[140],"revision":[141],"v1":[143],"(DMTCS":[144],"review":[145],"process),":[146],"results":[147,165],"unchanged;":[148],"v3:":[149],"enabled":[152],"hyperref":[153],"Figure":[155],"1;":[156],"v4:":[157],"add":[160],"reference":[161],"known":[163],"slenderness":[168],"problem;":[169],"v5:":[170],"added":[173],"DMTCS":[174],"metadata":[175]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}