Reset Complexity of Ideal Languages Over a Binary Alphabet

标题
Reset Complexity of Ideal Languages Over a Binary Alphabet
作者
关键词
-
出版物
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Volume 30, Issue 06n07, Pages 1177-1196
出版商
World Scientific Pub Co Pte Lt
发表日期
2019-09-19
DOI
10.1142/s0129054119400343

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

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

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started