{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VQLLPX3MSMWVWFFKSRLPGOE5UM","short_pith_number":"pith:VQLLPX3M","schema_version":"1.0","canonical_sha256":"ac16b7df6c932d5b14aa9456f3389da336ca5b434e83ea8813485d5248123f65","source":{"kind":"arxiv","id":"1204.0833","version":1},"attestation_state":"computed","paper":{"title":"Bounded Counter Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Holger Petersen","submitted_at":"2012-04-03T23:29:49Z","abstract_excerpt":"We show that deterministic finite automata equipped with $k$ two-way heads are equivalent to deterministic machines with a single two-way input head and $k-1$ linearly bounded counters if the accepted language is strictly bounded, i.e., a subset of $a_1^*a_2^*... a_m^*$ for a fixed sequence of symbols $a_1, a_2,..., a_m$. Then we investigate linear speed-up for counter machines. Lower and upper time bounds for concrete recognition problems are shown, implying that in general linear speed-up does not hold for counter machines. For bounded languages we develop a technique for speeding up computa"},"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":"1204.0833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-04-03T23:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"34f61ff7535c3961b30508f3120a367049b33c1e8c90c68cd44073ef76bf09ee","abstract_canon_sha256":"8c827c4956ee14c1d938ab230db4f9d706cad579fcfe4a296c391a566a183ea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:48.842762Z","signature_b64":"d0OvXFFE+NMAKnlNTPxcrxgB//o4Sg9rOjGBNt68ejbQ79peUpJWwnF3bGB+PJpsClvfkc52JZ1fDDQCO7ElDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac16b7df6c932d5b14aa9456f3389da336ca5b434e83ea8813485d5248123f65","last_reissued_at":"2026-05-18T02:45:48.842249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:48.842249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Counter Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Holger Petersen","submitted_at":"2012-04-03T23:29:49Z","abstract_excerpt":"We show that deterministic finite automata equipped with $k$ two-way heads are equivalent to deterministic machines with a single two-way input head and $k-1$ linearly bounded counters if the accepted language is strictly bounded, i.e., a subset of $a_1^*a_2^*... a_m^*$ for a fixed sequence of symbols $a_1, a_2,..., a_m$. Then we investigate linear speed-up for counter machines. Lower and upper time bounds for concrete recognition problems are shown, implying that in general linear speed-up does not hold for counter machines. For bounded languages we develop a technique for speeding up computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0833","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":"1204.0833","created_at":"2026-05-18T02:45:48.842340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0833v1","created_at":"2026-05-18T02:45:48.842340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0833","created_at":"2026-05-18T02:45:48.842340+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQLLPX3MSMWV","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQLLPX3MSMWVWFFK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQLLPX3M","created_at":"2026-05-18T12:27:25.539911+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/VQLLPX3MSMWVWFFKSRLPGOE5UM","json":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM.json","graph_json":"https://pith.science/api/pith-number/VQLLPX3MSMWVWFFKSRLPGOE5UM/graph.json","events_json":"https://pith.science/api/pith-number/VQLLPX3MSMWVWFFKSRLPGOE5UM/events.json","paper":"https://pith.science/paper/VQLLPX3M"},"agent_actions":{"view_html":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM","download_json":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM.json","view_paper":"https://pith.science/paper/VQLLPX3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0833&json=true","fetch_graph":"https://pith.science/api/pith-number/VQLLPX3MSMWVWFFKSRLPGOE5UM/graph.json","fetch_events":"https://pith.science/api/pith-number/VQLLPX3MSMWVWFFKSRLPGOE5UM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM/action/storage_attestation","attest_author":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM/action/author_attestation","sign_citation":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM/action/citation_signature","submit_replication":"https://pith.science/pith/VQLLPX3MSMWVWFFKSRLPGOE5UM/action/replication_record"}},"created_at":"2026-05-18T02:45:48.842340+00:00","updated_at":"2026-05-18T02:45:48.842340+00:00"}