Descriptional and computational complexity of finite automata—A survey

标题
Descriptional and computational complexity of finite automata—A survey
作者
关键词
-
出版物
INFORMATION AND COMPUTATION
Volume 209, Issue 3, Pages 456-470
出版商
Elsevier BV
发表日期
2010-11-20
DOI
10.1016/j.ic.2010.11.013

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

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

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