{"id":"https://openalex.org/W2952653060","doi":"https://doi.org/10.1109/lics.2017.8005079","title":"Regular separability of one counter automata","display_name":"Regular separability of one counter automata","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2952653060","doi":"https://doi.org/10.1109/lics.2017.8005079","mag":"2952653060"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5113969130","display_name":"Wojciech Czerwi\u0144ski","orcid":"https://orcid.org/0000-0002-6169-868X"},"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 Czerwinski","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"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/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":"Slawomir Lasota","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":1.9007,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85932666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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.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/T12072","display_name":"Machine Learning and Algorithms","score":0.9853000044822693,"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.7672759294509888},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.6860647201538086},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6032858490943909},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5894474983215332},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.531922459602356},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5105656385421753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4951607286930084},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4951559603214264},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.45596522092819214},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.45579513907432556},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4230806529521942},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.4210923910140991},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3940185606479645},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38255923986434937},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1970399022102356}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7672759294509888},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6860647201538086},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6032858490943909},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5894474983215332},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.531922459602356},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5105656385421753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4951607286930084},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4951559603214264},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.45596522092819214},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.45579513907432556},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4230806529521942},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.4210923910140991},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3940185606479645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38255923986434937},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1970399022102356},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2017.8005079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd 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":30,"referenced_works":["https://openalex.org/W209374521","https://openalex.org/W1496021453","https://openalex.org/W1551851178","https://openalex.org/W1573542260","https://openalex.org/W1625359640","https://openalex.org/W1849255017","https://openalex.org/W1903463847","https://openalex.org/W1984570925","https://openalex.org/W2004710041","https://openalex.org/W2008435081","https://openalex.org/W2051274456","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/W2530935015","https://openalex.org/W2565201908","https://openalex.org/W2952380278","https://openalex.org/W2962811419","https://openalex.org/W3101938203","https://openalex.org/W3183766709","https://openalex.org/W3200493159","https://openalex.org/W6634361747","https://openalex.org/W6649090136","https://openalex.org/W6690170141","https://openalex.org/W6725082985","https://openalex.org/W6729122178","https://openalex.org/W6731151814"],"related_works":["https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W3186009139","https://openalex.org/W2619559442","https://openalex.org/W1993598446","https://openalex.org/W2037872771","https://openalex.org/W1987608226","https://openalex.org/W2124370744","https://openalex.org/W2462239665","https://openalex.org/W2171527505"],"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":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}