带禁止的基本语法类
Basic Classes of Grammars with Prohibition
摘要：
在形式语法和语言的背景下，开发了一个实用的自然语言建模和人机交互开发工具。本文介绍了一种新的形式文法--禁止文法。与传统的形式语法相比，禁止语法为自然语言的生成提供了更强有力的工具，更好地描述了语言学习的过程。在这里，我们研究的语言之间的关系所产生的不同的语法禁止的基础上，传统类型的形式语法，如上下文无关或上下文敏感的语法。此外，我们还比较了由不同的禁止文法生成的语言和由常规形式文法生成的语言。特别是，它表明，他们有本质上更高的计算能力和表达的可能性相比，传统的形式语法。因此，虽然传统的形式文法是递归和次递归算法，但许多禁止的文法是超递归算法。在这项工作中提出的结果是针对发展的人机交互，建模自然语言，授权的程序设计语言，计算机模拟，更好的软件系统，和递归理论。
英文摘要：
A practical tool for natural language modeling and development of human-machine interaction is developed in the context of formal grammars and languages. A new type of formal grammars, called grammars with prohibition, is introduced. Grammars with prohibition provide more powerful tools for natural language generation and better describe processes of language learning than the conventional formal grammars. Here we study relations between languages generated by different grammars with prohibition based on conventional types of formal grammars such as context-free or context sensitive grammars. Besides, we compare languages generated by different grammars with prohibition and languages generated by conventional formal grammars. In particular, it is demonstrated that they have essentially higher computational power and expressive possibilities in comparison with the conventional formal grammars. Thus, while conventional formal grammars are recursive and subrecursive algorithms, many classes of grammars with prohibition are superrecursive algorithms. Results presented in this work are aimed at the development of human-machine interaction, modeling natural languages, empowerment of programming languages, computer simulation, better software systems, and theory of recursion.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
