Algebraic criteria for finite automata understanding of regular language

Yan Yongyi; Yue Jumei; Fu Zhumu; Chen Zengqiang

首页> 外文期刊>Frontiers of computer science >Algebraic criteria for finite automata understanding of regular language

【24h】

Algebraic criteria for finite automata understanding of regular language

机译：用于有限自动机的代数标准了解常规语言

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

著录项
相似文献
相关主题

著录项

来源
《Frontiers of computer science》 |2019年第5期|1148-1150|共3页
作者
Yan Yongyi; Yue Jumei; Fu Zhumu; Chen Zengqiang;
展开▼
作者单位

Henan Univ Sci & Technol Sch Informat Engn Luoyang 471003 Henan Peoples R China;

Henan Univ Sci & Technol Coll Agr Equipment Engn Luoyang 471003 Henan Peoples R China;

Henan Univ Sci & Technol Sch Informat Engn Luoyang 471003 Henan Peoples R China;

Nankai Univ Coll Artificial Intelligence Tianjin 300071 Peoples R China;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. Algebraic criteria for finite automata understanding of regular language [J] . Yan Yongyi, Yue Jumei, Fu Zhumu, Frontiers of computer science in China . 2019,第5期

机译：有限自动机对常规语言的理解的代数准则
2. Using ε Value in Describe Regular Languages by Using Finite Automata, Operation on Languages and the Changing Algorithm Implementation [J] . Abdulmajid Mukhtar Afat International Journal of Information Technology . 2019,第3期

机译：通过有限自动机使用ε值描述常规语言，语言操作和变化的算法实现
3. Regular Languages: To Finite Automata and Beyond (Invited Talk) [J] . Prigioniero Luca OASIcs : OpenAccess Series in Informatics . 2021,第a期

机译：常规语言：为有限自动机和超越（邀请的谈话）
4. Learning Regular Languages Using Nondeterministic Finite Automata [C] . Pedro Garcia, Manuel Vazquez de Parga, Gloria I. Alvarez, Implementation and Application of Automata . 2008

机译：使用不确定的有限自动机学习常规语言
5. Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks [D] . Patterson, Brian 2011

机译：计算理论中的三个主题：多分辨率元胞自动机，常规语言的Kolmogorov复杂性表征以及贝叶斯网络中的隐藏变量
6. How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines [O] . Marta Dueñas-Díez, Juan Pérez-Mercader 2019

机译：化学如何计算：非生化化学自动机的语言识别。从有限的自动机到图灵机
7. Finite regular semigroups which are amalgamation bases for finite semigroups (Algebraic Semigroups, Formal Languages and Computation) [O] . Shoji Kunitaka 2001

机译：有限规则半群，它们是有限半群（代数半群，形式语言和计算）的合并基础
8. THE THEORY OF ALGEBRAIC AUTOMATA I:MORPHISMS AND REGULAR SYSTEMS [R] . Yehoshafat Give'on 1964

机译：代数自动机理论I：形态和正则系统

Algebraic criteria for finite automata understanding of regular language

著录项

相似文献

相关主题

期刊订阅