Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition

Title
Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
Authors
Keywords
-
Journal
Frontiers of Computer Science
Volume 8, Issue 6, Pages 948-957
Publisher
Springer Nature
Online
2014-09-03
DOI
10.1007/s11704-014-3425-y

Ask authors/readers for more resources

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

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