Given the original total binary transition table of a deterministic automaton wi...
https://datenvertrag.halowerk.com/v1/binary-automaton-reset-word-ledgerOverview
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.
Protocol
x402 (POST)
Price
$0.0030
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
media/images
Provider
datenvertrag
Source
bazaar
Indexed
2026-11-05 13:37:30
Health
Status
unknown
Latency (p50)
—
Uptime (30d)
—
Reliability Score
—
Last Checked
Never
Last Healthy
Never
Consecutive Failures
0
x402 Payment Validation
Payment Requirements
—
Asset Verified
—
Facilitator
—
Input Schema
{
"body": {
"claimed_length": 9,
"states": 4,
"transitions": [
[
1,
1
],
[
1,
2
],
[
2,
3
],
[
3,
0
]
]
},
"bodyType": "json",
"method": "POST",
"type": "http"
}