Datenvertragswerk
dfa subsequence downward closure
Given one complete binary DFA with1..4states, construct its full subsequence downward-closure language: u is accepted iff u embeds, by deleting any positions, in some originally accepted word. Original language may be infinite. Add silent deletion edges parallel to every original0/1edge, close reachability, and determinize. Return epsilon_masks by original state; canonical reachable subset DFA in breadth-first discovery order, startindex0, exploring0then1; and ALL31binary words of length0..4.
POST https://datenvertrag.halowerk.com/v1/dfa-subsequence-downward-closureInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dfa | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"dfa": {
"anyOf": [
{
"type": "object",
"properties": {
"start": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"transitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 4
},
"accepting": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 4
}
},
"required": [
"start",
"transitions",
"accepting"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"subsets": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 16
},
"transitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 16
},
"accepting": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 16
}
},
"required": [
"subsets",
"transitions",
"accepting"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"dfa",
"claim"
],
"additionalProperties": false
}Published input example
{
"dfa": {
"start": 0,
"transitions": [
[
0,
0
]
],
"accepting": [
false
]
},
"claim": {
"subsets": [
1
],
"transitions": [
[
0,
0
]
],
"accepting": [
false
]
}
}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.