An agent that publishes a finite dictionary automaton needs its claimed minimal ...

{ "body": { "artifact": { "claimed_states": 11, "words": [ [ 1 ], [ 3 ], [ 1, 2, 3, 3 ], [ 0, 1, 1, 1, 1 ], [ 2, 3 ], [], [ 0, 3, 2 ], [ 2, 1 ] ] } }, "bodyType": "json", "method": "POST", "type": "http" }

{ "example": { "billable": true, "findings": [ { "confidence": 100, "evidence": [ { "page_indices": [], "page_url": null, "pattern": "feed-minimal-acyclic-dictionary-state-count_scoped_evidence", "type": "artifact" } ], "limits": [ "Only the explicit bounded artifact is measured. No retrieval, execution, real credential validation, contact output or legal/security/quality judgement.", "Finite numeric words, alphabet0..15, length<=64, at most128 words and4096 total symbols. Duplicate words are idempotent; the empty word is supported. Reachable minimal partial deterministic acyclic automaton, missing transitions reject and no explicit dead state is counted. Empty dictionary has one rejecting root." ], "module": "feed-minimal-acyclic-dictionary-state-count", "module_cpu_ms": 0, "state": "not_observed", "value": { "claimed_minimal_state_count_matches": true, "distinct_words": 8, "minimal_partial_dfa_states": 11, "minimal_partial_dfa_transitions": 15, "supplied_words": 8, "trie_states": 16 }, "warnings": [] } ], "known_count": 1, "scope": { "contact_values_returned": false, "network": false, "supplied_artifact_only": true }, "warnings": [] }, "type": "json" }