An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions (Q998679)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions |
scientific article; zbMATH DE number 5504344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions |
scientific article; zbMATH DE number 5504344 |
Statements
An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions (English)
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
0 references
0.7189772725105286
0 references
0.6924769878387451
0 references
0.6895078420639038
0 references
0.6863889694213867
0 references
