{"id":"https://openalex.org/W52870181","doi":null,"title":"Languages that are Recognized by Simple Counter Automata are not necessarily Testable","display_name":"Languages that are Recognized by Simple Counter Automata are not necessarily Testable","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W52870181","mag":"52870181"},"language":"en","primary_location":{"id":"mag:52870181","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc12.html#TR05-152","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5083612161","display_name":"Oded Lachish","orcid":"https://orcid.org/0000-0001-5406-8121","observed_orcids":["https://orcid.org/0000-0001-5406-8121"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oded Lachish","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5406-8121","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005870042","display_name":"Ilan Newman","orcid":"https://orcid.org/0000-0002-4845-4111","observed_orcids":["https://orcid.org/0000-0002-4845-4111"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilan Newman","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4845-4111","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"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.9854000210762024,"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.9854000210762024,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.003800000064074993,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/testability","display_name":"testability","score":0.597000002861023},{"id":"https://openalex.org/keywords/regular-languages","display_name":"regular languages","score":0.8169999718666077},{"id":"https://openalex.org/keywords/context-free-languages","display_name":"context-free languages","score":0.949999988079071},{"id":"https://openalex.org/keywords/query-complexity","display_name":"query complexity","score":0.8199999928474426},{"id":"https://openalex.org/keywords/formal-language-theory","display_name":"formal language theory","score":0.33399999141693115}],"concepts":[{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.7428385615348816},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6786061525344849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6086001992225647},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5926023721694946},{"id":"https://openalex.org/C51234621","wikidata":"https://www.wikidata.org/wiki/Q2149495","display_name":"Testability","level":2,"score":0.5571442246437073},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5323781371116638},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4607492685317993},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4450725317001343},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4408075213432312},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3771817088127136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3495156168937683},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:52870181","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc12.html#TR05-152","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W104148001","https://openalex.org/W1595588542","https://openalex.org/W1970630090","https://openalex.org/W2018925011","https://openalex.org/W2036501955","https://openalex.org/W2115082275","https://openalex.org/W3004537778"],"related_works":["https://openalex.org/W7099779468","https://openalex.org/W2118242820","https://openalex.org/W2036501955","https://openalex.org/W2188733162","https://openalex.org/W1582948223","https://openalex.org/W2033030697","https://openalex.org/W4416893606","https://openalex.org/W3104869282","https://openalex.org/W7161110387","https://openalex.org/W2064465758"],"abstract_inverted_index":{"Combinatorial":[0],"property":[1,14,27],"testing":[2],"deals":[3],"with":[4],"the":[5,26,33,89],"following":[6],"relaxation":[7],"of":[8],"decision":[9],"problems:":[10],"Given":[11],"a":[12,60,66],"xed":[13],"and":[15,44],"an":[16],"input":[17],"f,":[18],"one":[19],"wants":[20],"to":[21],"decide":[22],"whether":[23],"f":[24],"satises":[25],"or":[28],"is":[29,63],"\u2018far\u2019":[30],"from":[31],"satisfying":[32],"property.":[34],"It":[35],"has":[36],"been":[37],"shown":[38],"that":[39,45,57,62,81],"regular":[40],"languages":[41],"are":[42,52],"testable,":[43],"there":[46,58],"exist":[47],"context":[48],"free":[49],"language":[50,61],"which":[51,71],"not":[53,97],"testable.":[54],"We":[55],"show":[56],"exists":[59],"accepted":[64],"by":[65],"deterministic":[67],"counter":[68],"automaton":[69,93],"for":[70],"any":[72],"1=25-test":[73],"requires":[74],"(":[75],"poly(log":[76],"n))":[77],"queries.":[78],"Thus,":[79],"proving":[80],"even":[82],"if":[83],"we":[84,95],"restrict":[85],"ourselves":[86],"to,":[87],"perhaps":[88],"simplest":[90],"possible":[91],"stack":[92],"model,":[94],"do":[96],"ensure":[98],"testability.":[99]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}