{"id":"https://openalex.org/W2575208042","doi":"https://doi.org/10.23638/lmcs-15(2:20)2019","title":"Regular Separability of One Counter Automata","display_name":"Regular Separability of One Counter Automata","publication_year":2019,"publication_date":"2019-06-11","ids":{"openalex":"https://openalex.org/W2575208042","doi":"https://doi.org/10.23638/lmcs-15(2:20)2019","mag":"2575208042"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(2:20)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:20)2019","pdf_url":"https://lmcs.episciences.org/5563/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in 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://lmcs.episciences.org/5563/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113969130","display_name":"Wojciech Czerwi\u0144ski","orcid":"https://orcid.org/0000-0002-6169-868X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wojciech Czerwi\u0144ski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102789796","display_name":"S\u0142awomir Lasota","orcid":"https://orcid.org/0000-0001-8674-4470"},"institutions":[{"id":"https://openalex.org/I4210098975","display_name":"WSB Merito University in Warsaw","ror":"https://ror.org/00yt9w502","country_code":"PL","type":"education","lineage":["https://openalex.org/I4210098975"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"S\u0142awomir Lasota","raw_affiliation_strings":["Wydzia l Matematyki , Informatyki i Mechaniki , University of Warsaw , Poland"],"raw_orcid":"https://orcid.org/0000-0001-8674-4470","affiliations":[{"raw_affiliation_string":"Wydzia l Matematyki , Informatyki i Mechaniki , University of Warsaw , Poland","institution_ids":["https://openalex.org/I4210098975"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113969130"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00450434,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 15, Issue 2","issue":null,"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":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/T10142","display_name":"Formal Methods in Verification","score":0.9962999820709229,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9894999861717224,"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.7703220844268799},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6193563938140869},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6164441704750061},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5974273681640625},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5964464545249939},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5680435299873352},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5381963849067688},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5370352268218994},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3599984645843506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2501186728477478},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1289215087890625}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7703220844268799},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6193563938140869},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6164441704750061},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5974273681640625},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5964464545249939},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5680435299873352},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5381963849067688},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5370352268218994},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3599984645843506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2501186728477478},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1289215087890625},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-15(2:20)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:20)2019","pdf_url":"https://lmcs.episciences.org/5563/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1701.02808","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.02808","pdf_url":"https://arxiv.org/pdf/1701.02808","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1701.02808","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1701.02808","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/lmcs-15(2:20)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:20)2019","pdf_url":"https://lmcs.episciences.org/5563/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7970926153","display_name":null,"funder_award_id":"683080","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2575208042.pdf","grobid_xml":"https://content.openalex.org/works/W2575208042.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W209374521","https://openalex.org/W1496021453","https://openalex.org/W1524248088","https://openalex.org/W1551851178","https://openalex.org/W1652781893","https://openalex.org/W1849255017","https://openalex.org/W1903463847","https://openalex.org/W1984570925","https://openalex.org/W1994584977","https://openalex.org/W2008435081","https://openalex.org/W2017315323","https://openalex.org/W2051274456","https://openalex.org/W2106001218","https://openalex.org/W2113283923","https://openalex.org/W2124287344","https://openalex.org/W2162593546","https://openalex.org/W2241347640","https://openalex.org/W2258615751","https://openalex.org/W2275415862","https://openalex.org/W2544425934","https://openalex.org/W2596765965","https://openalex.org/W2907944076","https://openalex.org/W2952380278","https://openalex.org/W2962811419","https://openalex.org/W2962880731","https://openalex.org/W2963008222","https://openalex.org/W2963218063","https://openalex.org/W2963253063","https://openalex.org/W3104838059"],"related_works":["https://openalex.org/W2349952486","https://openalex.org/W1489260687","https://openalex.org/W2775700832","https://openalex.org/W1971653407","https://openalex.org/W2950141706","https://openalex.org/W1965531865","https://openalex.org/W1974626062","https://openalex.org/W2401586919","https://openalex.org/W2275545295","https://openalex.org/W4381706435"],"abstract_inverted_index":{"The":[0],"regular":[1,13,33,68],"separability":[2,34,69],"problem":[3,35,58,70],"asks,":[4],"for":[5,36,59,71],"two":[6],"given":[7],"languages,":[8],"if":[9],"there":[10],"exists":[11],"a":[12],"language":[14],"including":[15],"one":[16,39,48,60,72],"of":[17,31,38,55,66],"them":[18],"but":[19],"disjoint":[20],"from":[21],"the":[22,32,56,67],"other.":[23],"Our":[24],"main":[25],"result":[26],"is":[27,76],"decidability,":[28],"and":[29,63],"PSpace-completeness,":[30],"languages":[37],"counter":[40,49,61,73],"automata":[41],"without":[42],"zero":[43],"tests":[44],"(also":[45],"known":[46],"as":[47],"nets).":[50],"This":[51],"contrasts":[52],"with":[53,64],"undecidability":[54,65],"regularity":[57],"nets,":[62],"automata,":[74],"which":[75],"our":[77],"second":[78],"result.":[79]},"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}