{"id":"https://openalex.org/W1486959147","doi":"https://doi.org/10.1007/3-540-44669-9_20","title":"On the Complexity of Decidable Cases of Commutation Problem for Languages","display_name":"On the Complexity of Decidable Cases of Commutation Problem for Languages","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1486959147","doi":"https://doi.org/10.1007/3-540-44669-9_20","mag":"1486959147"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44669-9_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44669-9_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5085504322","display_name":"Juhani Karhum\u00e4ki","orcid":null},"institutions":[{"id":"https://openalex.org/I183173800","display_name":"Turku Centre for Computer Science","ror":"https://ror.org/00vy7ed73","country_code":"FI","type":"facility","lineage":["https://openalex.org/I130217899","https://openalex.org/I155660961","https://openalex.org/I183173800"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Juhani Karhum\u00e4ki","raw_affiliation_strings":["Department of Mathematics and and Turku Centre for Computer Science, Turku, 20014, Finland","Department of Mathematics and and Turku Centre for Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and and Turku Centre for Computer Science, Turku, 20014, Finland","institution_ids":["https://openalex.org/I183173800"]},{"raw_affiliation_string":"Department of Mathematics and and Turku Centre for Computer Science","institution_ids":["https://openalex.org/I183173800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113508045","display_name":"Wojciech Plandowski","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Plandowski","raw_affiliation_strings":["Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland","Uniwersytet  Warszawski"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Uniwersytet  Warszawski","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079957387","display_name":"Wojciech Rytter","orcid":"https://orcid.org/0000-0002-9162-6724"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["GB","PL"],"is_corresponding":false,"raw_author_name":"Wojciech Rytter","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Great Britain","Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland","Uniwersytet Warszawski","University of Liverpool"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Great Britain","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Uniwersytet Warszawski","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Liverpool","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4181,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62951807,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"203"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9955000281333923,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9950000047683716,"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/decidability","display_name":"Decidability","score":0.7054373025894165},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7046176195144653},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.654403805732727},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5896275043487549},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5885307788848877},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5454006195068359},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5183009505271912},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5065490007400513},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.45554038882255554},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4551149010658264},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.4504106044769287},{"id":"https://openalex.org/keywords/commutation","display_name":"Commutation","score":0.44741690158843994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44125232100486755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43701571226119995},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4309156537055969},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4205203652381897},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41729164123535156},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.33620375394821167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2963296175003052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2907176613807678},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2679198086261749},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2507753372192383}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7054373025894165},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7046176195144653},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.654403805732727},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5896275043487549},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5885307788848877},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5454006195068359},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5183009505271912},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5065490007400513},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.45554038882255554},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4551149010658264},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.4504106044769287},{"id":"https://openalex.org/C2780147050","wikidata":"https://www.wikidata.org/wiki/Q5155085","display_name":"Commutation","level":3,"score":0.44741690158843994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44125232100486755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43701571226119995},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4309156537055969},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4205203652381897},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41729164123535156},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.33620375394821167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2963296175003052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2907176613807678},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2679198086261749},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2507753372192383},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44669-9_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44669-9_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W106053274","https://openalex.org/W318121553","https://openalex.org/W938151848","https://openalex.org/W1514324498","https://openalex.org/W1539226081","https://openalex.org/W1551828758","https://openalex.org/W1570949334","https://openalex.org/W1600029487","https://openalex.org/W1884045513","https://openalex.org/W1993370765","https://openalex.org/W2002089154","https://openalex.org/W2011039300","https://openalex.org/W2034921735","https://openalex.org/W2039984653","https://openalex.org/W2065394462","https://openalex.org/W2066064214","https://openalex.org/W2153128123","https://openalex.org/W2403587904","https://openalex.org/W2499290539","https://openalex.org/W2611477341","https://openalex.org/W2913383557","https://openalex.org/W4211010176","https://openalex.org/W4255404799","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2772918710","https://openalex.org/W2488819432","https://openalex.org/W2136740376","https://openalex.org/W2037872771","https://openalex.org/W1968608348","https://openalex.org/W2006629323","https://openalex.org/W2394954760","https://openalex.org/W4246705858","https://openalex.org/W4379879532","https://openalex.org/W4315705843"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}