Datenvertragswerk
bideterministic automaton star height certificate
Compute the exact ordinary Kleene star height of the language recognized by an original finite partial BIDETERMINISTIC automaton, with single initial/final state, already minimal and trim. Input1..6states,1..3 distinct alphabet symbols, transitions -1 for undefined. Every symbol transition is partial injective; trim and pairwise distinguishability are required admission hypotheses, not assumed from a rank scalar. Return exact language star height via McNaughton theorem, the full.
POST https://datenvertrag.halowerk.com/v1/bideterministic-automaton-star-height-certificateInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | integer | Yes | |
| alphabet | array | Yes | |
| transitions | array | Yes | |
| initial | integer | Yes | |
| final | integer | Yes | |
| claim_star_height | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"alphabet",
"transitions",
"initial",
"final",
"claim_star_height"
],
"properties": {
"n": {
"type": "integer",
"minimum": 1,
"maximum": 6
},
"alphabet": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "string",
"minLength": 1,
"maxLength": 8
}
},
"transitions": {
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": -1,
"maximum": 5
}
}
},
"initial": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"final": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"claim_star_height": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 6
},
{
"type": "null"
}
]
}
}
}Published input example
{
"n": 2,
"alphabet": [
"a"
],
"transitions": [
[
1
],
[
-1
]
],
"initial": 0,
"final": 1,
"claim_star_height": 0
}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.