Algebraic criteria for finite automata understanding of regular language

标题
Algebraic criteria for finite automata understanding of regular language
作者
关键词
-
出版物
Frontiers of Computer Science
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2019-05-25
DOI
10.1007/s11704-019-6525-x

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

Find the ideal target journal for your manuscript

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

Search

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now