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


An Algorithm for Recognizing the Spherical Transitivity of an Initial Binary Automaton
Authors:Lipina  T I
Institution:1.Lomonosov Moscow State University, 119991, Moscow, Russia
;
Abstract:Mathematical Notes - An algorithm is presented which determines in a finite number of steps whether an initial finite binary automaton is spherically transitive. Since the class of deterministic...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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