Language acceptability of finite automata based on theory of semi-tensor product of matrices (Q5131102)
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: Language acceptability of finite automata based on theory of semi-tensor product of matrices |
scientific article; zbMATH DE number 7268765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Language acceptability of finite automata based on theory of semi-tensor product of matrices |
scientific article; zbMATH DE number 7268765 |
Statements
Language acceptability of finite automata based on theory of semi‐tensor product of matrices (English)
0 references
2 November 2020
0 references
finite automata
0 references
finite-valued systems
0 references
logical systems
0 references
matrix approach
0 references
semi-tensor product of matrices
0 references
0 references
0 references
0.8673897981643677
0 references
0.7569748163223267
0 references
0.738226056098938
0 references
