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


Finite automata over a direct product of free semigroups and groups and languages
Authors:P. V. Gorshkov  A. B. Stavrovskii
Abstract:A finite-automaton-algebraic model of formal languages is described. It is shown how particular cases of this model characterize the classes of recursively enumerable and context-free languages.Translated from Kibernetika, No. 4, pp. 16–20, July–August, 1990.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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