Endpoint · extractionPOSTdatenvertrag.halowerk.com /v1/binary-automaton-reset-word-ledger
Given the original total binary transition table of a deterministic automaton with 1..4 states, reconstruct every reachable state subset and labelled transition, the minimum…
Read more
Given the original total binary transition table of a deterministic automaton with 1..4 states, reconstruct every reachable state subset and labelled transition, the minimum reset-word length, the exact number of shortest binary words, the lexicographically first word and its full image trace. Distinct symbol words remain distinct when they reach the same subset. A one-state automaton resets by the empty word. Claim -1 means no reset word; null claim or missing table remains unknown.Overview
Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.003 per call
Paid calls
none yet
delivery unknown until someone pays
More info
Seller?
URL
https://datenvertrag.halowerk.com/v1/binary-automaton-reset-word-ledger
Seen
first 12 days ago · last 4 days ago
47 free handshakes
Payment
Pays through
x402
Offered on?
Base USDC
Listed on?
Base
Paid calls
No paid calls yet.
Delivery is unknown until someone pays. A handshake only shows it asks for payment.
Verify it yourself
npx teppi-check https://datenvertrag.halowerk.com/v1/binary-automaton-reset-word-ledgercurl -s https://api.teppi.xyz/v1/trust/cap_01M6RBZE8EE1PVARG20RDXZGA5