Distinguishability and completeness of crisp deterministic fuzzy automata (Q4553373)
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: Distinguishability and completeness of crisp deterministic fuzzy automata |
scientific article; zbMATH DE number 6971016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distinguishability and completeness of crisp deterministic fuzzy automata |
scientific article; zbMATH DE number 6971016 |
Statements
2 November 2018
0 references
crisp deterministic fuzzy automaton
0 references
indistinguishable states
0 references
input-indistinguishable
0 references
homomorphism
0 references
output complete
0 references
DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA (English)
0 references
0 references
0 references
0 references
0 references
0.7886273860931396
0 references
0.757404625415802
0 references
0.7530508041381836
0 references
0.7524778246879578
0 references
