首页 | 本学科首页   官方微博 | 高级检索  
     


On the subword complexity of DOL languages with a constant distribution
Authors:A Ehrenfeucht  G Rozenberg
Affiliation:Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309, U.S.A.;Institute of Applied Mathematics and Computer Science, University of Leiden, Wassenaarseweg 80, Leiden, The Netherlands
Abstract:
Keywords:DOL  languages  subword complexity  formal languages
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号