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


A limit theorem for sets of subwords in deterministic TOL languages
Authors:A Ehrenfeucht  G Rozenberg
Affiliation:Department of Computer Science, University of Colorado, Boulder, Colorado, USA;Department of Computer Science, State University of New York at Buffalo, Amherst, New York, USA;Mathematical Institute, Utrecht State University, Utrecht, The Netherlands
Abstract:
Keywords:formal languages  development systems  deterministic restriction
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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