An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions (Q998679)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions
scientific article

    Statements

    An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2009
    0 references
    discrete event systems
    0 references
    automata
    0 references
    observability
    0 references
    state clusters
    0 references
    supervisory control
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references