{"id":"https://openalex.org/W2771635306","doi":"https://doi.org/10.1142/s0129054117400019","title":"A Logical Characterization of Small 2NFAs","display_name":"A Logical Characterization of Small 2NFAs","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2771635306","doi":"https://doi.org/10.1142/s0129054117400019","mag":"2771635306"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117400019","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117400019","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","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/A5023928618","display_name":"Christos A. Kapoutsis","orcid":"https://orcid.org/0000-0001-8963-9326"},"institutions":[{"id":"https://openalex.org/I4210089979","display_name":"Carnegie Mellon University Qatar","ror":"https://ror.org/00az5dt38","country_code":"QA","type":"education","lineage":["https://openalex.org/I4210089979","https://openalex.org/I74973139"]}],"countries":["QA"],"is_corresponding":true,"raw_author_name":"Christos A. Kapoutsis","raw_affiliation_strings":["Carnegie Mellon University in Qatar, Education City, P.O. Box 24866, Doha, Qatar"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University in Qatar, Education City, P.O. Box 24866, Doha, Qatar","institution_ids":["https://openalex.org/I4210089979"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020301676","display_name":"Lamana Mulaffer","orcid":null},"institutions":[{"id":"https://openalex.org/I58152225","display_name":"Texas A&M University at Qatar","ror":"https://ror.org/03vb4dm14","country_code":"QA","type":"education","lineage":["https://openalex.org/I58152225","https://openalex.org/I91045830"]}],"countries":["QA"],"is_corresponding":false,"raw_author_name":"Lamana Mulaffer","raw_affiliation_strings":["Texas A&M University at Qatar, Education City, P.O. Box 23874, Doha, Qatar"],"affiliations":[{"raw_affiliation_string":"Texas A&M University at Qatar, Education City, P.O. Box 23874, Doha, Qatar","institution_ids":["https://openalex.org/I58152225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023928618"],"corresponding_institution_ids":["https://openalex.org/I4210089979"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21026945,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"28","issue":"05","first_page":"445","last_page":"464"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9980999827384949,"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.9976000189781189,"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/transitive-closure","display_name":"Transitive closure","score":0.7986928224563599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7916829586029053},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6934903860092163},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6849949955940247},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5866599678993225},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.5416986346244812},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5350106358528137},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.43148571252822876},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4183053970336914},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4113052785396576}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7986928224563599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7916829586029053},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6934903860092163},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6849949955940247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5866599678993225},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.5416986346244812},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5350106358528137},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.43148571252822876},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4183053970336914},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4113052785396576},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054117400019","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117400019","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2043360684","https://openalex.org/W4205178514","https://openalex.org/W4236835455"],"related_works":["https://openalex.org/W67269200","https://openalex.org/W4248488207","https://openalex.org/W4213231691","https://openalex.org/W2168681835","https://openalex.org/W2131473039","https://openalex.org/W2067838189","https://openalex.org/W2963351616","https://openalex.org/W1550103109","https://openalex.org/W2502826815","https://openalex.org/W2771635306"],"abstract_inverted_index":{"Let":[0],"2N":[1,22],"be":[2,106],"the":[3,35],"class":[4],"of":[5,7,12,17,25,27,29,44,111],"families":[6,11,26],"problems":[8],"solvable":[9],"by":[10],"two-way":[13],"nondeterministic":[14,115],"finite":[15],"automata":[16,86],"polynomial":[18],"size.":[19],"We":[20,83],"characterize":[21],"in":[23,64],"terms":[24],"formulas":[28,33,95],"transitive-closure":[30,36,120],"logic.":[31],"These":[32],"apply":[34],"operator":[37],"on":[38],"a":[39,109],"quantifier-free":[40],"disjunctive":[41],"normal":[42],"form":[43],"first-order":[45],"logic":[46,121],"with":[47,87,96],"successor":[48],"and":[49,67,77,100],"constants,":[50],"where":[51],"(i)":[52],"apart":[53],"from":[54],"two":[55,74],"special":[56,75],"variables,":[57],"all":[58],"others":[59],"are":[60,91],"equated":[61],"to":[62,79],"constants":[63],"every":[65],"clause,":[66],"(ii)":[68],"no":[69],"clause":[70],"simultaneously":[71],"relates":[72],"these":[73],"variables":[76],"refers":[78],"fixed":[80],"input":[81],"cells.":[82],"prove":[84],"that":[85,114],"polynomially":[88,97,101],"many":[89,98],"states":[90],"as":[92,94,108],"powerful":[93],"clauses":[99],"large":[102],"constants.":[103],"This":[104],"can":[105],"seen":[107],"refinement":[110],"Immerman\u2019s":[112],"theorem":[113],"logarithmic":[116],"space":[117],"matches":[118],"positive":[119],"([Formula:":[122],"see":[123],"text]).":[124]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}