欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
初步建立基于完备剩余格值逻辑自动机与文法理论的基本框架．引入l值正则文法的概念，证明了任意l值自动机识别的语言等价于某种l值正则文法所生成的语言，反之，任意l值正则文法所生成的语言等价于某种l值自动机识别的语言．获得l值自动机及被2值自动机识别的语言的连接问题刻画．特别地，建立l值和L值泵引理，并得到l值语言的判定性刻画．最后，揭示带ε移动的l值自动机与不带ε移动的l值自动机之间的两个等价关系．
英文摘要：
A fundamental framework of automata and valued logic is preliminarily established. Firstly, is proved that any l value l value regular grammar, language grammars theory based on complete residuated lattice- the concept of l value regular grammars is introduced. It recognized by l value automaton is equivalent to that generated by some and conversely, the I value language generated by any l value regular grammar is also equivalent to that recognized by some l value automaton. Afterwards, the concatenations of l value automaton and l value pumping 1emma and L language is presented. language without ε-transitions is recognized by l value automaton are depicted. In particular, the 1 value value pumping lemma are built, and then a decision characterization of l value Finally, the equivalence between the l value automata with ε-transitions and those revealed.
同期刊论文项目
同项目期刊论文
Several teleportation schemes of an arbitrary unknown multi-particle state via different quantum cha
Quantum three-qubit w-state sharing via positive operator-valued measurement and projective measurem
Remote information concentration via four-particle cluster state and by positive operator-value meas
期刊信息
位置：