{
    "card": {
        "schema": "https://ver.cy/schemas/card/1.0.0",
        "id": "vr.tr.deterministic-finite-automata",
        "code": "thing-q837528",
        "url": "https://ver.cy/models/thing/q837528/",
        "name": "deterministic finite automata",
        "alternateNames": [
            "deterministic acyclic finite state automaton",
            "Suffix automaton",
            "semiautomaton"
        ],
        "kind": "thing",
        "status": "draft-generated",
        "version": "vr.draft.v3",
        "language": "en",
        "classifiers": {
            "family": "Thing Registry",
            "category": "Information and virtual systems",
            "entryKind": "discipline or field of knowledge",
            "plane": "INF",
            "domain": [
                "INF.KNW"
            ],
            "industry": [],
            "navPath": "",
            "tags": [],
            "facets": []
        },
        "whatItIs": "An informational thing registered under INF.KNW. The registry names it; this draft has not been given a definition yet.",
        "purpose": "Give an agent a durable, checkable way to recognise a deterministic finite automata, record what state it is in, and decide what may be done with it.",
        "scope": {
            "in": [],
            "out": [],
            "boundaries": []
        },
        "distinguishingFeatures": [
            "Names folded into this entry, which a task may need to split apart again: deterministic acyclic finite state automaton, Suffix automaton, semiautomaton.",
            "3 finer distinctions are held as aliases rather than separate entries, because telling them apart needs a task that asks for it.",
            "Described in 26 Wikipedia languages, which is a measure of how widely the thing is known, not of how important it is."
        ],
        "structure": {
            "bundles": [
                {
                    "id": "identity-and-classification",
                    "name": "Identity, naming and classification",
                    "description": "How an agent tells one deterministic finite automata from another, and a deterministic finite automata from things that resemble it.",
                    "rationale": "Recognition comes before every other claim. Without stable identity nothing else in the model can be trusted to be about the same thing twice.",
                    "layers": [
                        {
                            "id": "naming-and-identifiers",
                            "name": "Names and identifiers",
                            "description": "The names this thing goes by and the identifiers that survive translation and time.",
                            "findings": [
                                {
                                    "id": "preferred-name-and-aliases",
                                    "name": "Preferred name, aliases and local names",
                                    "description": "Which name to use, which names mean the same thing, and which merely sound similar.",
                                    "questions": [
                                        {
                                            "id": "preferred-name-and-aliases-q01",
                                            "text": "What identifies and describes the name of a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "preferred-name-and-aliases-q02",
                                            "text": "Who or what asserted this about the name of a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "preferred-name-and-aliases-q03",
                                            "text": "What may an agent decide or do once the name of a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                },
                                {
                                    "id": "stable-identifiers",
                                    "name": "Stable identifiers and external keys",
                                    "description": "Identifiers that keep pointing at this kind of thing across systems and languages.",
                                    "questions": [
                                        {
                                            "id": "stable-identifiers-q01",
                                            "text": "What identifies and describes an identifier for a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "stable-identifiers-q02",
                                            "text": "Who or what asserted this about an identifier for a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "stable-identifiers-q03",
                                            "text": "What may an agent decide or do once an identifier for a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        },
                        {
                            "id": "classification-and-granularity",
                            "name": "Classification and granularity",
                            "description": "Where a deterministic finite automata sits among kinds, and how finely a task needs to cut it.",
                            "findings": [
                                {
                                    "id": "kind-and-parents",
                                    "name": "Kind, parents and neighbouring kinds",
                                    "description": "The classes this thing belongs to and the ones it is next to.",
                                    "questions": [
                                        {
                                            "id": "kind-and-parents-q01",
                                            "text": "What identifies and describes the kind of a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "kind-and-parents-q02",
                                            "text": "Who or what asserted this about the kind of a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "kind-and-parents-q03",
                                            "text": "What may an agent decide or do once the kind of a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                },
                                {
                                    "id": "distinguishing-features",
                                    "name": "Distinguishing features",
                                    "description": "What separates a deterministic finite automata from the things most often confused with it.",
                                    "questions": [
                                        {
                                            "id": "distinguishing-features-q01",
                                            "text": "What identifies and describes what distinguishes a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "distinguishing-features-q02",
                                            "text": "Who or what asserted this about what distinguishes a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "distinguishing-features-q03",
                                            "text": "What may an agent decide or do once what distinguishes a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        }
                    ]
                },
                {
                    "id": "state-and-lifecycle",
                    "name": "State and lifecycle",
                    "description": "The states a deterministic finite automata passes through and the events that move it between them.",
                    "rationale": "Most decisions about a thing depend on what state it is in now, which is a claim with a time on it, not a property.",
                    "layers": [
                        {
                            "id": "lifecycle-stages",
                            "name": "Lifecycle stages",
                            "description": "From coming into existence to ceasing to be one of these.",
                            "findings": [
                                {
                                    "id": "stages-and-transitions",
                                    "name": "Stages and transitions",
                                    "description": "The stages worth naming and what moves a deterministic finite automata between them.",
                                    "questions": [
                                        {
                                            "id": "stages-and-transitions-q01",
                                            "text": "What identifies and describes the lifecycle of a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "stages-and-transitions-q02",
                                            "text": "Who or what asserted this about the lifecycle of a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "stages-and-transitions-q03",
                                            "text": "What may an agent decide or do once the lifecycle of a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        },
                        {
                            "id": "observations-and-status",
                            "name": "Observations and current status",
                            "description": "What is observed about a deterministic finite automata, how often and by whom.",
                            "findings": [
                                {
                                    "id": "observation-record",
                                    "name": "Observation record",
                                    "description": "How an observation of a deterministic finite automata is recorded so that it can be superseded rather than overwritten.",
                                    "questions": [
                                        {
                                            "id": "observation-record-q01",
                                            "text": "What identifies and describes an observation of a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "observation-record-q02",
                                            "text": "Who or what asserted this about an observation of a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "observation-record-q03",
                                            "text": "What may an agent decide or do once an observation of a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        }
                    ]
                },
                {
                    "id": "content-and-access",
                    "name": "Content, encoding and access",
                    "description": "What a deterministic finite automata says, how it is encoded and who may read it.",
                    "rationale": "An informational thing carries content that can be copied, versioned and withheld, none of which its physical carrier explains.",
                    "layers": [
                        {
                            "id": "content-and-encoding",
                            "name": "Content and encoding",
                            "description": "The content itself, its format and its language.",
                            "findings": [
                                {
                                    "id": "content-and-format",
                                    "name": "Content, format and language",
                                    "description": "What a deterministic finite automata contains and in what form it is held.",
                                    "questions": [
                                        {
                                            "id": "content-and-format-q01",
                                            "text": "What identifies and describes the content of a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "content-and-format-q02",
                                            "text": "Who or what asserted this about the content of a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "content-and-format-q03",
                                            "text": "What may an agent decide or do once the content of a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        },
                        {
                            "id": "access-and-rights",
                            "name": "Access, rights and retention",
                            "description": "Who may read, copy or change it, and for how long it is kept.",
                            "findings": [
                                {
                                    "id": "access-rules",
                                    "name": "Access rules and retention",
                                    "description": "The permissions attached to a deterministic finite automata and the period it survives.",
                                    "questions": [
                                        {
                                            "id": "access-rules-q01",
                                            "text": "What identifies and describes access to a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "access-rules-q02",
                                            "text": "Who or what asserted this about access to a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "access-rules-q03",
                                            "text": "What may an agent decide or do once access to a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        }
                    ]
                },
                {
                    "id": "subject-and-method",
                    "name": "Subject matter and method",
                    "description": "What deterministic finite automata studies and how it establishes anything.",
                    "rationale": "A field is identified by its questions and its methods, and those are what distinguish it from the fields next to it.",
                    "layers": [
                        {
                            "id": "subject",
                            "name": "Subject matter",
                            "description": "The questions it takes as its own.",
                            "findings": [
                                {
                                    "id": "subject-record",
                                    "name": "Questions and objects of study",
                                    "description": "What it is about, stated so a neighbouring field can be told apart.",
                                    "questions": [
                                        {
                                            "id": "subject-record-q01",
                                            "text": "What questions and objects does deterministic finite automata take as its own?",
                                            "kind": "definition"
                                        },
                                        {
                                            "id": "subject-record-q02",
                                            "text": "Which questions does it share with a neighbouring field, and who claims them?",
                                            "kind": "boundary"
                                        }
                                    ]
                                }
                            ]
                        },
                        {
                            "id": "method",
                            "name": "Method and evidence",
                            "description": "How claims are established and what counts as evidence.",
                            "findings": [
                                {
                                    "id": "method-record",
                                    "name": "Methods and standards of evidence",
                                    "description": "The methods used and what they are taken to establish.",
                                    "questions": [
                                        {
                                            "id": "method-record-q01",
                                            "text": "By what methods does deterministic finite automata establish claims, and what counts as sufficient evidence?",
                                            "kind": "provenance"
                                        },
                                        {
                                            "id": "method-record-q02",
                                            "text": "What kind of claim can this field not settle, and where should an agent look instead?",
                                            "kind": "action"
                                        }
                                    ]
                                }
                            ]
                        }
                    ]
                },
                {
                    "id": "institutions-and-classification",
                    "name": "Institutions and classification",
                    "description": "Where deterministic finite automata is practised and how catalogues place it.",
                    "rationale": "The institutional footprint is the evidence that a field exists as a field rather than as a topic.",
                    "layers": [
                        {
                            "id": "institutions",
                            "name": "Institutional markers",
                            "description": "Societies, journals, degrees and departments.",
                            "findings": [
                                {
                                    "id": "institution-record",
                                    "name": "Bodies and venues",
                                    "description": "Where the field organises itself.",
                                    "questions": [
                                        {
                                            "id": "institution-record-q01",
                                            "text": "Which societies, journals or degrees mark deterministic finite automata as an established field?",
                                            "kind": "provenance"
                                        },
                                        {
                                            "id": "institution-record-q02",
                                            "text": "What would show that it is emerging or dissolving rather than established?",
                                            "kind": "boundary"
                                        }
                                    ]
                                }
                            ]
                        },
                        {
                            "id": "classification",
                            "name": "Classification schemes",
                            "description": "Where library and research classifications put it.",
                            "findings": [
                                {
                                    "id": "classification-record",
                                    "name": "Codes and their disagreements",
                                    "description": "The classification codes that place it, and where they differ.",
                                    "questions": [
                                        {
                                            "id": "classification-record-q01",
                                            "text": "Which classification schemes place deterministic finite automata, under what codes?",
                                            "kind": "definition"
                                        },
                                        {
                                            "id": "classification-record-q02",
                                            "text": "Where do those schemes disagree about its scope?",
                                            "kind": "boundary"
                                        }
                                    ]
                                }
                            ]
                        }
                    ]
                },
                {
                    "id": "provenance-and-evidence",
                    "name": "Provenance, evidence and time",
                    "description": "Where every claim about a deterministic finite automata came from and when it held.",
                    "rationale": "A claim without a source and a time cannot be superseded, only overwritten, and an agent that overwrites loses the ability to explain itself.",
                    "layers": [
                        {
                            "id": "source-and-authority",
                            "name": "Source and authority",
                            "description": "Who said it, on what evidence, and how strongly.",
                            "findings": [
                                {
                                    "id": "claim-provenance",
                                    "name": "Claim provenance and confidence",
                                    "description": "The authority behind each claim about a deterministic finite automata and how confident it is.",
                                    "questions": [
                                        {
                                            "id": "claim-provenance-q01",
                                            "text": "What identifies and describes a claim about a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "claim-provenance-q02",
                                            "text": "Who or what asserted this about a claim about a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "claim-provenance-q03",
                                            "text": "What may an agent decide or do once a claim about a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        },
                        {
                            "id": "time-and-versions",
                            "name": "Time, versions and supersession",
                            "description": "When a claim was true, when it was learnt, and what replaced it.",
                            "findings": [
                                {
                                    "id": "validity-and-supersession",
                                    "name": "Validity period and supersession",
                                    "description": "How an old claim about a deterministic finite automata is retired without being erased.",
                                    "questions": [
                                        {
                                            "id": "validity-and-supersession-q01",
                                            "text": "What identifies and describes the validity of a claim about a deterministic finite automata, and in what units or vocabulary?",
                                            "kind": "definition",
                                            "answer_data": [
                                                "identifiers",
                                                "types and classes",
                                                "values with units",
                                                "explicit unknowns"
                                            ]
                                        },
                                        {
                                            "id": "validity-and-supersession-q02",
                                            "text": "Who or what asserted this about the validity of a claim about a deterministic finite automata, by which method, and when was it true?",
                                            "kind": "provenance",
                                            "answer_data": [
                                                "authority",
                                                "method",
                                                "evidence",
                                                "event time",
                                                "knowledge time"
                                            ]
                                        },
                                        {
                                            "id": "validity-and-supersession-q03",
                                            "text": "What may an agent decide or do once the validity of a claim about a deterministic finite automata is known, and what must it refuse?",
                                            "kind": "action",
                                            "answer_data": [
                                                "permitted actions",
                                                "preconditions",
                                                "refusals",
                                                "escalation"
                                            ]
                                        }
                                    ]
                                }
                            ]
                        }
                    ]
                }
            ]
        },
        "agentConduct": {
            "may": [
                "read it and act on what it says"
            ],
            "mustNot": [],
            "requiresHuman": []
        },
        "ethics": {
            "considerations": [],
            "affectedParties": []
        },
        "owners": {
            "steward": "",
            "roles": [],
            "masterSystems": []
        },
        "relations": [
            {
                "target": "deterministic acyclic finite state automaton",
                "type": "related",
                "note": "covers: Finer kinds folded into this entry because telling them apart needs a task that asks for it. Each is a model waiting to be split out when one does."
            },
            {
                "target": "Suffix automaton",
                "type": "related",
                "note": "covers: Finer kinds folded into this entry because telling them apart needs a task that asks for it. Each is a model waiting to be split out when one does."
            },
            {
                "target": "semiautomaton",
                "type": "related",
                "note": "covers: Finer kinds folded into this entry because telling them apart needs a task that asks for it. Each is a model waiting to be split out when one does."
            }
        ],
        "interaction": {
            "identity": {
                "applicability": "required",
                "items": []
            },
            "properties": {
                "applicability": "not-applicable",
                "items": [
                    "Made of: content that has to be carried by something else",
                    "Does nothing on its own; everything it does, something else did to it.",
                    "These come from the domain this entry sits in rather than from the entry itself, so treat them as a first guess about the whole domain applied to one thing."
                ]
            },
            "recognition": {
                "applicability": "optional",
                "items": []
            },
            "capabilities": {
                "applicability": "required",
                "items": [
                    "read and interpreted"
                ]
            },
            "hazards": {
                "applicability": "required",
                "items": []
            },
            "interfaces": {
                "applicability": "required",
                "items": []
            },
            "context": {
                "applicability": "required",
                "items": [
                    "Described in 26 Wikipedia languages, which measures how widely it is written about rather than how important or how common it is. 3 finer distinctions are held inside this entry as names rather than as separate models."
                ]
            }
        },
        "sources": [],
        "openQuestions": [
            "Which of the bundles below does a real task actually need, and which are ceremony?",
            "What does this thing have that the facets do not capture at all?",
            "Which neighbouring kind is most often confused with a deterministic finite automata, and on what evidence are they told apart?",
            "What may an agent decide or do once the name of a deterministic finite automata is known, and what must it refuse?",
            "What may an agent decide or do once an identifier for a deterministic finite automata is known, and what must it refuse?",
            "What may an agent decide or do once the kind of a deterministic finite automata is known, and what must it refuse?"
        ],
        "resources": {
            "spec": "/models/thing/q837528/?format=json"
        },
        "provenance": {
            "origin": "thing registry, generated draft (pass 1)",
            "builtFrom": [
                "models/draft_model.php",
                "wikidata"
            ],
            "providers": [
                "vr.draft.v3"
            ],
            "researchStatus": "not researched",
            "generatedAt": "",
            "builder": "models/card_draft.php"
        },
        "completeness": {
            "sections": {
                "classifiers": "filled",
                "whatItIs": "derived",
                "purpose": "derived",
                "distinguishingFeatures": "derived",
                "structure": "derived",
                "agentConduct": "derived",
                "ethics": "missing",
                "owners": "missing",
                "relations": "derived",
                "interaction.identity": "missing",
                "interaction.properties": "not-applicable",
                "interaction.recognition": "missing",
                "interaction.capabilities": "derived",
                "interaction.hazards": "missing",
                "interaction.interfaces": "missing",
                "interaction.context": "derived",
                "sources": "missing"
            },
            "notes": {
                "_": "Generated by rule from registry facets. No source was read; every derived section awaits the research pass."
            },
            "score": 0.313
        }
    },
    "model": {
        "rank": 21172,
        "code": "thing-q837528",
        "model_id": "vr.tr.deterministic-finite-automata",
        "name": "deterministic finite automata",
        "purpose": "",
        "family": "Thing Registry",
        "category": "Information and virtual systems",
        "status": "draft-generated",
        "kind": "thing",
        "plane": "INF",
        "domain": "INF.KNW",
        "industry": "",
        "version": "",
        "url": "/models/thing/q837528/",
        "tier": 2,
        "score": 26,
        "payload": {
            "layer": "wikidata",
            "aliases": [
                "deterministic acyclic finite state automaton",
                "Suffix automaton",
                "semiautomaton"
            ],
            "aliasCount": 3,
            "merged": 3,
            "knownIn": 26,
            "facets": null,
            "markers": [],
            "lexicalClass": "",
            "senseRank": null,
            "alsoRegisteredAs": null,
            "source": {
                "dataset": "wikidata",
                "item": "Q837528",
                "url": "https://www.wikidata.org/wiki/Q837528",
                "license": "CC0 1.0"
            }
        },
        "draft": {
            "generator": "vr.draft.v3",
            "status": "draft-generated",
            "researched": false,
            "archetype": "discipline or field of knowledge",
            "method": "Written from the archetype playbook - what this kind of thing needs beyond identity and provenance - and from the structure that recurred across 6,333 models already researched by two engines. Applied to this entry by rule. No source was read for this thing and no claim here is researched. This entry carries no facets of its own, so they were inferred from its domain - a guess about a whole domain applied to one thing.",
            "facetsInferred": true,
            "nextPass": "A researcher replaces this draft with a sourced specification. Treat every sentence below as a proposal to argue with.",
            "purpose": "Give an agent a durable, checkable way to recognise a deterministic finite automata, record what state it is in, and decide what may be done with it.",
            "whatItIs": "An informational thing registered under INF.KNW. The registry names it; this draft has not been given a definition yet.",
            "characteristics": {
                "substance": "information",
                "origin": "conceptual",
                "agency": "inert"
            },
            "whatYouCanDoWithIt": [
                "read and interpreted"
            ],
            "distinguishingFeatures": [
                "Names folded into this entry, which a task may need to split apart again: deterministic acyclic finite state automaton, Suffix automaton, semiautomaton.",
                "3 finer distinctions are held as aliases rather than separate entries, because telling them apart needs a task that asks for it.",
                "Described in 26 Wikipedia languages, which is a measure of how widely the thing is known, not of how important it is."
            ],
            "openQuestionsForResearch": [
                "Which of the bundles below does a real task actually need, and which are ceremony?",
                "What does this thing have that the facets do not capture at all?",
                "Which neighbouring kind is most often confused with a deterministic finite automata, and on what evidence are they told apart?"
            ],
            "whatItIsMadeOf": "content that has to be carried by something else",
            "physicalCharacter": [
                "Does nothing on its own; everything it does, something else did to it.",
                "These come from the domain this entry sits in rather than from the entry itself, so treat them as a first guess about the whole domain applied to one thing."
            ],
            "whatCanBeDoneWithIt": [
                "read it and act on what it says"
            ],
            "howItIsRecognised": [],
            "relatedModels": [
                {
                    "relation": "covers",
                    "note": "Finer kinds folded into this entry because telling them apart needs a task that asks for it. Each is a model waiting to be split out when one does.",
                    "targets": [
                        "deterministic acyclic finite state automaton",
                        "Suffix automaton",
                        "semiautomaton"
                    ]
                }
            ],
            "standing": "Described in 26 Wikipedia languages, which measures how widely it is written about rather than how important or how common it is. 3 finer distinctions are held inside this entry as names rather than as separate models.",
            "structure": {
                "bundles": [
                    {
                        "id": "identity-and-classification",
                        "name": "Identity, naming and classification",
                        "description": "How an agent tells one deterministic finite automata from another, and a deterministic finite automata from things that resemble it.",
                        "rationale": "Recognition comes before every other claim. Without stable identity nothing else in the model can be trusted to be about the same thing twice.",
                        "layers": [
                            {
                                "id": "naming-and-identifiers",
                                "name": "Names and identifiers",
                                "description": "The names this thing goes by and the identifiers that survive translation and time.",
                                "findings": [
                                    {
                                        "id": "preferred-name-and-aliases",
                                        "name": "Preferred name, aliases and local names",
                                        "description": "Which name to use, which names mean the same thing, and which merely sound similar.",
                                        "questions": [
                                            {
                                                "id": "preferred-name-and-aliases-q01",
                                                "text": "What identifies and describes the name of a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "preferred-name-and-aliases-q02",
                                                "text": "Who or what asserted this about the name of a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "preferred-name-and-aliases-q03",
                                                "text": "What may an agent decide or do once the name of a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    },
                                    {
                                        "id": "stable-identifiers",
                                        "name": "Stable identifiers and external keys",
                                        "description": "Identifiers that keep pointing at this kind of thing across systems and languages.",
                                        "questions": [
                                            {
                                                "id": "stable-identifiers-q01",
                                                "text": "What identifies and describes an identifier for a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "stable-identifiers-q02",
                                                "text": "Who or what asserted this about an identifier for a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "stable-identifiers-q03",
                                                "text": "What may an agent decide or do once an identifier for a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            },
                            {
                                "id": "classification-and-granularity",
                                "name": "Classification and granularity",
                                "description": "Where a deterministic finite automata sits among kinds, and how finely a task needs to cut it.",
                                "findings": [
                                    {
                                        "id": "kind-and-parents",
                                        "name": "Kind, parents and neighbouring kinds",
                                        "description": "The classes this thing belongs to and the ones it is next to.",
                                        "questions": [
                                            {
                                                "id": "kind-and-parents-q01",
                                                "text": "What identifies and describes the kind of a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "kind-and-parents-q02",
                                                "text": "Who or what asserted this about the kind of a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "kind-and-parents-q03",
                                                "text": "What may an agent decide or do once the kind of a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    },
                                    {
                                        "id": "distinguishing-features",
                                        "name": "Distinguishing features",
                                        "description": "What separates a deterministic finite automata from the things most often confused with it.",
                                        "questions": [
                                            {
                                                "id": "distinguishing-features-q01",
                                                "text": "What identifies and describes what distinguishes a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "distinguishing-features-q02",
                                                "text": "Who or what asserted this about what distinguishes a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "distinguishing-features-q03",
                                                "text": "What may an agent decide or do once what distinguishes a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            }
                        ]
                    },
                    {
                        "id": "state-and-lifecycle",
                        "name": "State and lifecycle",
                        "description": "The states a deterministic finite automata passes through and the events that move it between them.",
                        "rationale": "Most decisions about a thing depend on what state it is in now, which is a claim with a time on it, not a property.",
                        "layers": [
                            {
                                "id": "lifecycle-stages",
                                "name": "Lifecycle stages",
                                "description": "From coming into existence to ceasing to be one of these.",
                                "findings": [
                                    {
                                        "id": "stages-and-transitions",
                                        "name": "Stages and transitions",
                                        "description": "The stages worth naming and what moves a deterministic finite automata between them.",
                                        "questions": [
                                            {
                                                "id": "stages-and-transitions-q01",
                                                "text": "What identifies and describes the lifecycle of a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "stages-and-transitions-q02",
                                                "text": "Who or what asserted this about the lifecycle of a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "stages-and-transitions-q03",
                                                "text": "What may an agent decide or do once the lifecycle of a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            },
                            {
                                "id": "observations-and-status",
                                "name": "Observations and current status",
                                "description": "What is observed about a deterministic finite automata, how often and by whom.",
                                "findings": [
                                    {
                                        "id": "observation-record",
                                        "name": "Observation record",
                                        "description": "How an observation of a deterministic finite automata is recorded so that it can be superseded rather than overwritten.",
                                        "questions": [
                                            {
                                                "id": "observation-record-q01",
                                                "text": "What identifies and describes an observation of a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "observation-record-q02",
                                                "text": "Who or what asserted this about an observation of a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "observation-record-q03",
                                                "text": "What may an agent decide or do once an observation of a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            }
                        ]
                    },
                    {
                        "id": "content-and-access",
                        "name": "Content, encoding and access",
                        "description": "What a deterministic finite automata says, how it is encoded and who may read it.",
                        "rationale": "An informational thing carries content that can be copied, versioned and withheld, none of which its physical carrier explains.",
                        "layers": [
                            {
                                "id": "content-and-encoding",
                                "name": "Content and encoding",
                                "description": "The content itself, its format and its language.",
                                "findings": [
                                    {
                                        "id": "content-and-format",
                                        "name": "Content, format and language",
                                        "description": "What a deterministic finite automata contains and in what form it is held.",
                                        "questions": [
                                            {
                                                "id": "content-and-format-q01",
                                                "text": "What identifies and describes the content of a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "content-and-format-q02",
                                                "text": "Who or what asserted this about the content of a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "content-and-format-q03",
                                                "text": "What may an agent decide or do once the content of a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            },
                            {
                                "id": "access-and-rights",
                                "name": "Access, rights and retention",
                                "description": "Who may read, copy or change it, and for how long it is kept.",
                                "findings": [
                                    {
                                        "id": "access-rules",
                                        "name": "Access rules and retention",
                                        "description": "The permissions attached to a deterministic finite automata and the period it survives.",
                                        "questions": [
                                            {
                                                "id": "access-rules-q01",
                                                "text": "What identifies and describes access to a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "access-rules-q02",
                                                "text": "Who or what asserted this about access to a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "access-rules-q03",
                                                "text": "What may an agent decide or do once access to a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            }
                        ]
                    },
                    {
                        "id": "subject-and-method",
                        "name": "Subject matter and method",
                        "description": "What deterministic finite automata studies and how it establishes anything.",
                        "rationale": "A field is identified by its questions and its methods, and those are what distinguish it from the fields next to it.",
                        "layers": [
                            {
                                "id": "subject",
                                "name": "Subject matter",
                                "description": "The questions it takes as its own.",
                                "findings": [
                                    {
                                        "id": "subject-record",
                                        "name": "Questions and objects of study",
                                        "description": "What it is about, stated so a neighbouring field can be told apart.",
                                        "questions": [
                                            {
                                                "id": "subject-record-q01",
                                                "text": "What questions and objects does deterministic finite automata take as its own?",
                                                "kind": "definition"
                                            },
                                            {
                                                "id": "subject-record-q02",
                                                "text": "Which questions does it share with a neighbouring field, and who claims them?",
                                                "kind": "boundary"
                                            }
                                        ]
                                    }
                                ]
                            },
                            {
                                "id": "method",
                                "name": "Method and evidence",
                                "description": "How claims are established and what counts as evidence.",
                                "findings": [
                                    {
                                        "id": "method-record",
                                        "name": "Methods and standards of evidence",
                                        "description": "The methods used and what they are taken to establish.",
                                        "questions": [
                                            {
                                                "id": "method-record-q01",
                                                "text": "By what methods does deterministic finite automata establish claims, and what counts as sufficient evidence?",
                                                "kind": "provenance"
                                            },
                                            {
                                                "id": "method-record-q02",
                                                "text": "What kind of claim can this field not settle, and where should an agent look instead?",
                                                "kind": "action"
                                            }
                                        ]
                                    }
                                ]
                            }
                        ]
                    },
                    {
                        "id": "institutions-and-classification",
                        "name": "Institutions and classification",
                        "description": "Where deterministic finite automata is practised and how catalogues place it.",
                        "rationale": "The institutional footprint is the evidence that a field exists as a field rather than as a topic.",
                        "layers": [
                            {
                                "id": "institutions",
                                "name": "Institutional markers",
                                "description": "Societies, journals, degrees and departments.",
                                "findings": [
                                    {
                                        "id": "institution-record",
                                        "name": "Bodies and venues",
                                        "description": "Where the field organises itself.",
                                        "questions": [
                                            {
                                                "id": "institution-record-q01",
                                                "text": "Which societies, journals or degrees mark deterministic finite automata as an established field?",
                                                "kind": "provenance"
                                            },
                                            {
                                                "id": "institution-record-q02",
                                                "text": "What would show that it is emerging or dissolving rather than established?",
                                                "kind": "boundary"
                                            }
                                        ]
                                    }
                                ]
                            },
                            {
                                "id": "classification",
                                "name": "Classification schemes",
                                "description": "Where library and research classifications put it.",
                                "findings": [
                                    {
                                        "id": "classification-record",
                                        "name": "Codes and their disagreements",
                                        "description": "The classification codes that place it, and where they differ.",
                                        "questions": [
                                            {
                                                "id": "classification-record-q01",
                                                "text": "Which classification schemes place deterministic finite automata, under what codes?",
                                                "kind": "definition"
                                            },
                                            {
                                                "id": "classification-record-q02",
                                                "text": "Where do those schemes disagree about its scope?",
                                                "kind": "boundary"
                                            }
                                        ]
                                    }
                                ]
                            }
                        ]
                    },
                    {
                        "id": "provenance-and-evidence",
                        "name": "Provenance, evidence and time",
                        "description": "Where every claim about a deterministic finite automata came from and when it held.",
                        "rationale": "A claim without a source and a time cannot be superseded, only overwritten, and an agent that overwrites loses the ability to explain itself.",
                        "layers": [
                            {
                                "id": "source-and-authority",
                                "name": "Source and authority",
                                "description": "Who said it, on what evidence, and how strongly.",
                                "findings": [
                                    {
                                        "id": "claim-provenance",
                                        "name": "Claim provenance and confidence",
                                        "description": "The authority behind each claim about a deterministic finite automata and how confident it is.",
                                        "questions": [
                                            {
                                                "id": "claim-provenance-q01",
                                                "text": "What identifies and describes a claim about a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "claim-provenance-q02",
                                                "text": "Who or what asserted this about a claim about a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "claim-provenance-q03",
                                                "text": "What may an agent decide or do once a claim about a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            },
                            {
                                "id": "time-and-versions",
                                "name": "Time, versions and supersession",
                                "description": "When a claim was true, when it was learnt, and what replaced it.",
                                "findings": [
                                    {
                                        "id": "validity-and-supersession",
                                        "name": "Validity period and supersession",
                                        "description": "How an old claim about a deterministic finite automata is retired without being erased.",
                                        "questions": [
                                            {
                                                "id": "validity-and-supersession-q01",
                                                "text": "What identifies and describes the validity of a claim about a deterministic finite automata, and in what units or vocabulary?",
                                                "kind": "definition",
                                                "answer_data": [
                                                    "identifiers",
                                                    "types and classes",
                                                    "values with units",
                                                    "explicit unknowns"
                                                ]
                                            },
                                            {
                                                "id": "validity-and-supersession-q02",
                                                "text": "Who or what asserted this about the validity of a claim about a deterministic finite automata, by which method, and when was it true?",
                                                "kind": "provenance",
                                                "answer_data": [
                                                    "authority",
                                                    "method",
                                                    "evidence",
                                                    "event time",
                                                    "knowledge time"
                                                ]
                                            },
                                            {
                                                "id": "validity-and-supersession-q03",
                                                "text": "What may an agent decide or do once the validity of a claim about a deterministic finite automata is known, and what must it refuse?",
                                                "kind": "action",
                                                "answer_data": [
                                                    "permitted actions",
                                                    "preconditions",
                                                    "refusals",
                                                    "escalation"
                                                ]
                                            }
                                        ]
                                    }
                                ]
                            }
                        ]
                    }
                ]
            },
            "statistics": {
                "bundles": 6,
                "layers": 12,
                "findings": 14,
                "questions": 38
            }
        }
    }
}