Generativity of Self-Organizing Processes and Their Correlative Description in Terms of a Formal Language of Meta-Ordinal Generative Nature, in the Light of the Maximum Ordinality Principle and the Explicit Solution to the “Three-Body Problem”

The main objective of this paper is to demonstrate that the internal processes of Self-Organizing Systems represent a unique and singular process, characterized by their specific generativity. This process can be modeled using the Maximum Ordinality Principle and its associated formal language, known as the “Incipient” Differential Calculus (IDC).

Application of formal languages in polynomial transformations of instances between NP-complete problems

We propose the usage of formal languages for expressing instances of NP-complete problems for their application in polynomial transformations. The proposed approach, which consists of using formal language theory for polynomial transformations, is more robust, more practical, and faster to apply to real problems than the theory of polynomial transformations. In this paper we propose a methodology for transforming instances between NP-complete problems, which differs from Garey and Johnson's. Unlike most transformations which are used for proving that a problem is NP-complete based on the NP-completeness of another problem, the proposed approach is intended for extrapolating some known characteristics, phenomena, or behaviors from a problem A to another problem B. This extrapolation could be useful for predicting the performance of an algorithm for solving B based on its known performance for problem A, or for taking an algorithm that solves A and adapting it to solve B.

LANGUAGE CORNER Lesson 3:Authorizing the Handling of Formalities

地点:中国旅行社驻外分社营业部Setting:China Travel Service,Overseas Branch人物:杰克·乔治、黄先生Characters:Jack George and Mr.Huang 会话 Dialogue黄先生:乔治先生,您决定了没有?Mr.Huang:Have you made up your mind,Mr.George?乔治:你叫我杰克好了。我决定从上海入境。

COMPLEXITY OF EVOLUTION LANGUAGES OF THE ELEMENTARY CELLULAR AUTOMATON OF RULE 146

Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution language is not context-free but context-sensitive. Also, the same results hold for the equivalent （under conjugation） elementary cellular automaton of rule 182.

NewBee: Context-Free Grammar (CFG) of a New Programming Language for Novice Programmers

Learning programming and using programming languages are the essential aspects of computer science education.Students use programming languages to write their programs.These computer programs(students or practitioners written)make computers artificially intelligent and perform the tasks needed by the users.Without these programs,the computer may be visioned as a pointless machine.As the premise of writing programs is situated with specific programming languages,enormous efforts have been made to develop and create programming languages.However,each program-ming language is domain-specific and has its nuances,syntax and seman-tics,with specific pros and cons.These language-specific details,including syntax and semantics,are significant hurdles for novice programmers.Also,the instructors of introductory programming courses find these language specificities as the biggest hurdle in students learning,where more focus is on syntax than logic development and actual implementation of the program.Considering the conceptual difficulty of programming languages and novice students’struggles with the language syntax,this paper describes the design and development of a Context-Free Grammar(CFG)of a programming language for the novice,newcomers and students who do not have computer science as their major.Due to its syntax proximity to daily conversations,this paper hypothesizes that this language will be easy to use and understand by novice programmers.This paper systematically designed the language by identifying themes from various existing programming languages(e.g.,C,Python).Additionally,this paper surveyed computer science experts from industry and academia,where experts self-reported their satisfaction with the newly designed language.The results indicate that 93%of the experts reported satisfaction with the NewBee for novice,newcomer and non-Computer Sci-ence(CS)major students.

On Some Problems of Extracting the Root from a Given Finite Language

Based on the standard definition of the product (concatenation), the natural non-negative degree of the language is introduced. Root extraction is the reverse operation to it, and it can be defined in several different ways. Despite the simplicity of the formulation of the problem of extracting the root, the authors could not find any description of it in the literature (as well as on the Internet), including even its formulation. Most of the material in this article is devoted to the simplest version of the formulation: the root of the 2nd degree for the 1-letter alphabet, but many of the provisions of the article are generalized to more complex cases. Apparently, for a possible future description of a polynomial algorithm for solving at least one of the described statements of root extraction problems, it is first necessary to really analyze in detail such a special case, that is: either describe the necessary polynomial algorithm, or, conversely, show that the problem belongs to the class of NP-complete problems. Thus, in this article, we do not propose a polynomial algorithm for the problems under consideration;however, the models described here should help in constructing appropriate heuristic algorithms for their solution. A detailed description of the possible further application of such heuristic algorithms is beyond the scope of this article. .

EVOLUTION COMPL EXITY OF THE ELEMENTARY CELLULAR AUTOMATON OF RUL E 2 2

Cellular automata are the discrete dynamical systems of simple construction but with complex and varied behaviors.In this paper,the elementary cellular automaton of rule 22 is studied by the tools of formal language theory and symbolic dynamics.Its temporal evolution orbits are coarse grained into evolution sequences and the evolution languages are defined.It is proved that for every n ≥2 its width n evolution language is not regular.

COMPLEXITY ANALYSIS OF TIME SERIES GENERATED BY ELEMENTARY CELLULAR AUTOMATA

Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the classification problem of all 256 elementary cellular automata is discussed from the point of view of time series generated by them,and examples in each class are provided to explain the methods used.

The Web Application Test Based on Page Coverage Criteria

Software testing coverage criteria play an important role in the whole testing process.The current coverage criteria for web applications are based on program or URL.They are not suitable for black-box test or intuitional to use.This paper defines a kind of test criteria based on page coverage sequences only navigated by web application,including Page_Single,Page_Post,Page_Pre,Page_Seq2,Page_SeqK.The test criteria based on page coverage sequences made by interactions between web application and browser are being under consideration after that.In order to avoid ambiguity of natural language,these coverage criteria are depicted using Z formal language.The empirical result shows that the criteria complement traditional coverage and fault detection capability criteria.

New Refinement Relations of Z Specifications for Multiple Viewpoints Oriented Requirements Method

In this paper we develop several new refinement relations of Z for multiple viewpoints oriented requirements method (MVORM). The original motivation is that we found the standard Z refinement relation is not adequate or correct when considering specifications that have temporal relationships of operations. The concept of temporal state variables is introduced into Z. Then new implementation relations are defined and new refinement relations are deduced, mainly for temporal state variables to process temporal relationships of operations. We use state transition systems to abstract the temporal state transitions. A simple example is used to show the procedures of MVORM. Finally some directions of further work are forwarded.

THE Z SPECIFICATION DEPENDENCE GRAPH

The lack of existing solutions makes it really hard to understand formal specification languages since the application domain for representations is useful for the purpose of carrying out certain software engineering operations such as slicing and the computation of program metrics.A Z specification dependence graph is presented in this letter. It draws on the strengths of a range of earlier works and adapts them, if necessary, to the Z language.