Datenvertragswerk
context free grammar semilinear parikh witness
Construct the ENTIRE infinite semilinear Parikh image of an original context-free grammar in the explicit single-nonterminal profile: S=-1,alphabet terminals0..k-1,k1..3,1..4 distinct rules S->rhs with rhs length0..3. Arbitrary recursion,epsilon,unary terminal wrapping and binary/ternary branching are admitted. Return all canonical leaf-base components and shared nonzero pump-period vectors with original production/side-leaf context certificates. At most4bases/6periods suffice by the general.
POST https://datenvertrag.halowerk.com/v1/context-free-grammar-semilinear-parikh-witnessInputs
| Field | Type | Required | Description |
|---|---|---|---|
| alphabet_size | integer | Yes | |
| productions | array | Yes | |
| query | See schema | Yes | |
| claim_image | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"alphabet_size",
"productions",
"query",
"claim_image"
],
"properties": {
"alphabet_size": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"productions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 2
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 4
},
"query": {
"anyOf": [
{
"type": "null"
},
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 12
},
"minItems": 1,
"maxItems": 3
}
]
},
"claim_image": {
"anyOf": [
{
"type": "null"
},
{
"type": "object",
"additionalProperties": false,
"required": [
"bases",
"period_vectors"
],
"properties": {
"bases": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 4
},
"period_vectors": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 6
}
}
}
]
}
}
}Published input example
{
"alphabet_size": 2,
"productions": [
[
0,
-1,
1
],
[]
],
"query": [
2,
2
],
"claim_image": {
"bases": [
[
0,
0
]
],
"period_vectors": [
[
1,
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.