HALOWERKDatenvertragswerk
shortest state distinguishing experiment family
Given two permutation actions on 1..4 labelled states and a binary Moore output for each state, synthesize ALL shortest fixed binary input words whose complete output traces distinguish every ORIGINAL starting state. Observe the initial output at time0 and after each input. Return words in lexicographic order, aligned traces[word][initial_state][time], minimum_length and count. Empty word is permitted; no distinguishing experiment gives an empty family and null minimum_length. Action order.
POST https://datenvertrag.halowerk.com/v1/shortest-state-distinguishing-experiment-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| actions | Siehe Schema | Ja | |
| outputs | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"actions": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"minItems": 2,
"maxItems": 2
},
{
"type": "null"
}
]
},
"outputs": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"words": {
"type": "array",
"items": {
"type": "string",
"minLength": 0,
"maxLength": 9,
"pattern": "^[01]*$"
},
"minItems": 0,
"maxItems": 512
},
"traces": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 1,
"maxItems": 10
},
"minItems": 1,
"maxItems": 4
},
"minItems": 0,
"maxItems": 512
},
"minimum_length": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 9
},
{
"type": "null"
}
]
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 512
}
},
"required": [
"words",
"traces",
"minimum_length",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"actions",
"outputs",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"actions": [
[
0,
1,
3,
2
],
[
0,
2,
1,
3
]
],
"outputs": [
0,
0,
0,
1
],
"claim": {
"words": [
"010"
],
"traces": [
[
[
0,
0,
0,
0
],
[
0,
0,
0,
1
],
[
0,
1,
1,
0
],
[
1,
0,
0,
0
]
]
],
"minimum_length": 3,
"count": 1
}
}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