HALOWERKDatenvertragswerk
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 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. Claim.
POST https://datenvertrag.halowerk.com/v1/binary-automaton-reset-word-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| states | integer | Ja | |
| transitions | Siehe Schema | Ja | |
| claimed_length | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"states",
"transitions",
"claimed_length"
],
"properties": {
"states": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"transitions": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
},
{
"type": "null"
}
]
},
"claimed_length": {
"anyOf": [
{
"type": "integer",
"minimum": -1,
"maximum": 14
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"states": 4,
"transitions": [
[
1,
1
],
[
1,
2
],
[
2,
3
],
[
3,
0
]
],
"claimed_length": 9
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden