{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CDHX3KMNMHESE3KSNVLTZH6S5S","short_pith_number":"pith:CDHX3KMN","schema_version":"1.0","canonical_sha256":"10cf7da98d61c9226d526d573c9fd2ec9c324d7b46ef2034c6e5d99fecd13e6b","source":{"kind":"arxiv","id":"1010.3039","version":1},"attestation_state":"computed","paper":{"title":"Closure properties of predicates recognized by deterministic and non-deterministic asynchronous automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.GR"],"primary_cat":"math.LO","authors_text":"Maria Monks","submitted_at":"2010-10-14T22:27:45Z","abstract_excerpt":"Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of the classes of regular, quasi-regular, and weakly regular languages under first-order logic, and apply these observations to an open decidability problem in automatic group theory."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1010.3039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2010-10-14T22:27:45Z","cross_cats_sorted":["cs.LO","math.GR"],"title_canon_sha256":"5341542b79c5e6a05b70e389441c85b97a667e01c23e02c653c86629313be073","abstract_canon_sha256":"a972156bb17050c52c04e443444d7ecae304b84edafd9da63f496e7803fd00e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:17.977627Z","signature_b64":"W+D3o63nO3K5ISE0A61wwdFCVXvPEb88ggu4hdsJ7z0ynyKSZzyxII2GQiNAYpeW3o08Z+VW3qSJN6/QiemOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10cf7da98d61c9226d526d573c9fd2ec9c324d7b46ef2034c6e5d99fecd13e6b","last_reissued_at":"2026-05-18T04:39:17.976908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:17.976908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closure properties of predicates recognized by deterministic and non-deterministic asynchronous automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.GR"],"primary_cat":"math.LO","authors_text":"Maria Monks","submitted_at":"2010-10-14T22:27:45Z","abstract_excerpt":"Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of the classes of regular, quasi-regular, and weakly regular languages under first-order logic, and apply these observations to an open decidability problem in automatic group theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3039","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.3039","created_at":"2026-05-18T04:39:17.977013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3039v1","created_at":"2026-05-18T04:39:17.977013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3039","created_at":"2026-05-18T04:39:17.977013+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDHX3KMNMHES","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDHX3KMNMHESE3KS","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDHX3KMN","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S","json":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S.json","graph_json":"https://pith.science/api/pith-number/CDHX3KMNMHESE3KSNVLTZH6S5S/graph.json","events_json":"https://pith.science/api/pith-number/CDHX3KMNMHESE3KSNVLTZH6S5S/events.json","paper":"https://pith.science/paper/CDHX3KMN"},"agent_actions":{"view_html":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S","download_json":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S.json","view_paper":"https://pith.science/paper/CDHX3KMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3039&json=true","fetch_graph":"https://pith.science/api/pith-number/CDHX3KMNMHESE3KSNVLTZH6S5S/graph.json","fetch_events":"https://pith.science/api/pith-number/CDHX3KMNMHESE3KSNVLTZH6S5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S/action/storage_attestation","attest_author":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S/action/author_attestation","sign_citation":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S/action/citation_signature","submit_replication":"https://pith.science/pith/CDHX3KMNMHESE3KSNVLTZH6S5S/action/replication_record"}},"created_at":"2026-05-18T04:39:17.977013+00:00","updated_at":"2026-05-18T04:39:17.977013+00:00"}