Language acceptability of finite automata based on theory of semi‐tensor product of matrices

标题
Language acceptability of finite automata based on theory of semi‐tensor product of matrices
作者
关键词
-
出版物
ASIAN JOURNAL OF CONTROL
Volume -, Issue -, Pages -
出版商
Wiley
发表日期
2019-07-04
DOI
10.1002/asjc.2190

向作者/读者发起求助以获取更多资源

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started