Datenvertragswerk
rational weighted automaton minimal realization
Given a fully supplied rational weighted automaton alpha M(word) beta of dimension1..3 over1..2 ordered symbols, reconstruct a canonical minimum-dimensional linear realization of the ENTIRE word-to-rational series. Entries of original automaton must have reduced numerator absolute<=3 and denominator<=3; rational strings normalize exactly. Enumerate words lengthlex through n-1, select independent Hankel rows then columns in that order, and set reduced transitions H(Pa,S)*H(P,S)^-1. Return.
POST https://datenvertrag.halowerk.com/v1/rational-weighted-automaton-minimal-realizationInputs
| Field | Type | Required | Description |
|---|---|---|---|
| automaton | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"automaton": {
"anyOf": [
{
"type": "object",
"properties": {
"initial": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+(?:/[1-9][0-9]*)?$",
"maxLength": 64
},
"maxItems": 3
},
"transitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+(?:/[1-9][0-9]*)?$",
"maxLength": 64
},
"maxItems": 3
},
"maxItems": 3
},
"minItems": 1,
"maxItems": 2
},
"final": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+(?:/[1-9][0-9]*)?$",
"maxLength": 64
},
"maxItems": 3
}
},
"required": [
"initial",
"transitions",
"final"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"initial": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+(?:/[1-9][0-9]*)?$",
"maxLength": 64
},
"maxItems": 3
},
"transitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+(?:/[1-9][0-9]*)?$",
"maxLength": 64
},
"maxItems": 3
},
"maxItems": 3
},
"minItems": 1,
"maxItems": 2
},
"final": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+(?:/[1-9][0-9]*)?$",
"maxLength": 64
},
"maxItems": 3
},
"rank": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"required": [
"initial",
"transitions",
"final",
"rank"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"automaton",
"claim"
],
"additionalProperties": false
}Published input example
{
"automaton": {
"initial": [
"1",
"1"
],
"transitions": [
[
[
"1",
"0"
],
[
"0",
"1"
]
]
],
"final": [
"1",
"1"
]
},
"claim": {
"rank": 1,
"initial": [
"1"
],
"transitions": [
[
[
"1"
]
]
],
"final": [
"2"
]
}
}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.