{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CEXY6QZ3UKR7ZHNJMJWNM2PSJA","short_pith_number":"pith:CEXY6QZ3","schema_version":"1.0","canonical_sha256":"112f8f433ba2a3fc9da9626cd669f2482bc2b9258682dfc111a9aa10b00306c5","source":{"kind":"arxiv","id":"1701.03768","version":1},"attestation_state":"computed","paper":{"title":"Complexity of regular bifix-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marek Szyku{\\l}a, Robert Ferens","submitted_at":"2017-01-13T18:31:53Z","abstract_excerpt":"We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free languages that meet all the bounds for the state complexity basic operations (Boolean operations, product, star, and reversal). This is in contrast with suffix-free languages, where it is known that there does not exist such a stream. Then we present a stream of bifix-free languages that is most complex in terms of all basic operations, syntactic complexity,"},"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":"1701.03768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-13T18:31:53Z","cross_cats_sorted":[],"title_canon_sha256":"c7fe2322346b4888394056f5d5877cdc3f03cdd490ce2cc581d2c47da0090b37","abstract_canon_sha256":"acb26c37f5d7262181153b320628f709e480af13e1aac66b90443cc56bc9c843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:53.874361Z","signature_b64":"BrtFMFJ0gRwpjFqOCyIjgoTD66cgiWkLLmXysRo5nxwN+WI1mxBB7cv67wPNCPQYGLUg7eY7Hj+qusxsnOfMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112f8f433ba2a3fc9da9626cd669f2482bc2b9258682dfc111a9aa10b00306c5","last_reissued_at":"2026-05-18T00:52:53.873819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:53.873819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of regular bifix-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marek Szyku{\\l}a, Robert Ferens","submitted_at":"2017-01-13T18:31:53Z","abstract_excerpt":"We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free languages that meet all the bounds for the state complexity basic operations (Boolean operations, product, star, and reversal). This is in contrast with suffix-free languages, where it is known that there does not exist such a stream. Then we present a stream of bifix-free languages that is most complex in terms of all basic operations, syntactic complexity,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03768","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":"1701.03768","created_at":"2026-05-18T00:52:53.873900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03768v1","created_at":"2026-05-18T00:52:53.873900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03768","created_at":"2026-05-18T00:52:53.873900+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEXY6QZ3UKR7","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEXY6QZ3UKR7ZHNJ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEXY6QZ3","created_at":"2026-05-18T12:31:10.602751+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/CEXY6QZ3UKR7ZHNJMJWNM2PSJA","json":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA.json","graph_json":"https://pith.science/api/pith-number/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/graph.json","events_json":"https://pith.science/api/pith-number/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/events.json","paper":"https://pith.science/paper/CEXY6QZ3"},"agent_actions":{"view_html":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA","download_json":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA.json","view_paper":"https://pith.science/paper/CEXY6QZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03768&json=true","fetch_graph":"https://pith.science/api/pith-number/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/graph.json","fetch_events":"https://pith.science/api/pith-number/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/action/storage_attestation","attest_author":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/action/author_attestation","sign_citation":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/action/citation_signature","submit_replication":"https://pith.science/pith/CEXY6QZ3UKR7ZHNJMJWNM2PSJA/action/replication_record"}},"created_at":"2026-05-18T00:52:53.873900+00:00","updated_at":"2026-05-18T00:52:53.873900+00:00"}