Software tools are developed for computer realization of syntactic, semantic, and morphological models of natural language texts, using rule based programming. The tools are efficient for a language, which has free or...Software tools are developed for computer realization of syntactic, semantic, and morphological models of natural language texts, using rule based programming. The tools are efficient for a language, which has free order of words and developed morphological structure like Georgian. For instance, a Georgian verb has several thousand verb-forms. It is very difficult to express rules of morphological analysis by finite automaton and it will be inefficient as well. Resolution of some problems of full morphological analysis of Georgian words is impossible by finite automaton. Splitting of some Georgian verb-forms into morphemes requires non-deterministic search algorithm, which needs many backtrackings. To minimize backtrackings, it is necessary to put constraints, which exist among morphemes and verify them as soon as possible to avoid false directions of search. Software tool for syntactic analysis has means to reduce rules, which have the same members in different order. The authors used the tool for semantic analysis as well. Thus, proposed software tools have many means to construct efficient parser, test and correct it. The authors realized morphological and syntactic analysis of Georgian texts by these tools. In the presented paper, the authors describe the software tools and its application for Georgian language.展开更多
As an emerging new research area, DNA computation, or more generallybiomolecular computation, extends into other fields such as nanotechnology and material design, andis developing into a new sub-discipline of science...As an emerging new research area, DNA computation, or more generallybiomolecular computation, extends into other fields such as nanotechnology and material design, andis developing into a new sub-discipline of science and engineering. This paper provides a briefsurvey of some concepts and developments in this area. In particular several approaches aredescribed for biomolecular solutions of the satisfiability problem (using bit strands, DNA tiles andgraph self-assembly). Theoretical models such as the primer splicing systems as well as the recentmodel of forbidding and enforcing are also described. We review some experimental results ofself-assembly of DNA nanostructures and nanomechanical devices as well as the design of anautonomous finite state machine.展开更多
This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are i...This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are investigated, and the relationships between the eigenvalues and the limit set are developed. As an application, the nilpotent problem of elementary cellular automata(ECA) known as algorithmically undecidable is considered, and all the nilpotent ECA are found out which consists of rules 0, 8, 64, 239, 253, 255.展开更多
文摘Software tools are developed for computer realization of syntactic, semantic, and morphological models of natural language texts, using rule based programming. The tools are efficient for a language, which has free order of words and developed morphological structure like Georgian. For instance, a Georgian verb has several thousand verb-forms. It is very difficult to express rules of morphological analysis by finite automaton and it will be inefficient as well. Resolution of some problems of full morphological analysis of Georgian words is impossible by finite automaton. Splitting of some Georgian verb-forms into morphemes requires non-deterministic search algorithm, which needs many backtrackings. To minimize backtrackings, it is necessary to put constraints, which exist among morphemes and verify them as soon as possible to avoid false directions of search. Software tool for syntactic analysis has means to reduce rules, which have the same members in different order. The authors used the tool for semantic analysis as well. Thus, proposed software tools have many means to construct efficient parser, test and correct it. The authors realized morphological and syntactic analysis of Georgian texts by these tools. In the presented paper, the authors describe the software tools and its application for Georgian language.
文摘As an emerging new research area, DNA computation, or more generallybiomolecular computation, extends into other fields such as nanotechnology and material design, andis developing into a new sub-discipline of science and engineering. This paper provides a briefsurvey of some concepts and developments in this area. In particular several approaches aredescribed for biomolecular solutions of the satisfiability problem (using bit strands, DNA tiles andgraph self-assembly). Theoretical models such as the primer splicing systems as well as the recentmodel of forbidding and enforcing are also described. We review some experimental results ofself-assembly of DNA nanostructures and nanomechanical devices as well as the design of anautonomous finite state machine.
基金supported by the National Natural Science Foundation of China under Grant Nos.61473189,61374176,61203142 and 61203073a Doctoral Program of High Education of China under Grant No.20110073120027partly by the Excellent Young Technology Innovation Foundation of Hebei University of Technology under Grant No.2012005
文摘This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are investigated, and the relationships between the eigenvalues and the limit set are developed. As an application, the nilpotent problem of elementary cellular automata(ECA) known as algorithmically undecidable is considered, and all the nilpotent ECA are found out which consists of rules 0, 8, 64, 239, 253, 255.
