HALOWERKDatenvertragswerk
prefix function source word family
Given a whole prefix_table of length0..6 with integer0<=prefix_table[i]<=i, reconstruct EVERY word over the FIXED labelled alphabet0,1,2 whose prefix function equals that vector exactly. Entryi is the MAXIMUM length k<i+1 for which the firstk symbols equal the lastk symbols of prefix endingati. Empty match length0 allowed. Return every whole word as a digitstring in lexicographic order, count and realizable. No alphabet-renaming/reversal quotient: every original spelling retained..
POST https://datenvertrag.halowerk.com/v1/prefix-function-source-word-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| prefix_table | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"prefix_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 0,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"words": {
"type": "array",
"items": {
"type": "string",
"minLength": 0,
"maxLength": 6,
"pattern": "^[012]*$"
},
"minItems": 0,
"maxItems": 96
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 96
},
"realizable": {
"type": "boolean"
}
},
"required": [
"words",
"count",
"realizable"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"prefix_table",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"prefix_table": [],
"claim": {
"words": [
""
],
"count": 1,
"realizable": true
}
}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