Datenvertragswerk
minimum sample consistent dfa family
From one seven-entry observations vector over the words [empty,0,1,00,01,10,11] with values 0=reject, 1=accept, -1=explicitly unconstrained, finds every smallest reachable total deterministic binary automaton within the 1..3-state profile consistent with all labels. Each automaton is flat [delta(0,0),delta(0,1),.,delta(k-1,1),accept_mask], length 2*k+1. Returns minimum_states, the entire automata family and count; no guessed single classifier.
POST https://datenvertrag.halowerk.com/v1/minimum-sample-consistent-dfa-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| observations | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"observations": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 1
},
"minItems": 7,
"maxItems": 7
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"minimum_states": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"automata": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 3,
"maxItems": 7
},
"minItems": 0,
"maxItems": 256
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 300
}
},
"required": [
"minimum_states",
"automata",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"observations",
"claim"
],
"additionalProperties": false
}Published input example
{
"observations": [
0,
0,
0,
0,
0,
0,
0
],
"claim": {
"minimum_states": 1,
"automata": [
[
0,
0,
0
]
],
"count": 1
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- 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.