Solvability of the problem of completeness of automaton basis depending on its Boolean part (Q2319977)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7096708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solvability of the problem of completeness of automaton basis depending on its Boolean part |
scientific article; zbMATH DE number 7096708 |
Statements
Solvability of the problem of completeness of automaton basis depending on its Boolean part (English)
0 references
21 August 2019
0 references
0 references
0.8798091411590576
0 references
0.876516580581665
0 references
0.8493353128433228
0 references
