Finite state automata: A geometric approach

Recently, finite state automata, via the advent of hyperbolic and automatic groups, have become a powerful tool in geometric group theory. This paper develops a geometric approach to automata theory, analogous to various techniques used in combinatorial group theory, to solve various problems on the overlap between group theory and monoid theory. For instance, we give a geometric algorithm for computing the closure of a rational language in the profinite topology of a free group. We introduce some geometric notions for automata and show that certain important classes of monoids can be described in terms of the geometry of their Cayley graphs. A long standing open question, to which the answer was only known in the simplest of cases (and even then was non-trivial), is whether it is true, for a pseudovariety of groups , that a -trivial co-extension of a group in must divide a semidirect product of a -trivial monoid and a group in . We show the answer is affirmative if is closed under extension, and may be negative otherwise.

     

Types in a mixed language system

As a support for writing software, a comprehensive set of problem oriented languages appears preferable to any so-called universal language, as soon as static checking is sufficient to ensure type correctness of the mixed language program. We lay the basis for a mixed language system where this requirement is fulfilled. The general outline of the system is first sketched. Detailed consideration is then given to our basic constructs for establishing communication between languages, namely standard types and foreign types. Abstract types, such as defined in CLU, are finally shown to be a particular class of foreign types.     

初中化学用语的教学目标研究

以初中生化学用语测试、问卷调查、学生访谈、教师访谈和课堂观察等方面测查分析为依据,找出学生学习和教师教学中的主要问题。为了解决这些问题,开展了对初中化学用语教学目标的研究,编制了初中2个学段化学用语的教学目标。用具体的课堂教学案例,研究落实教学目标的方法。     

High Level Languages Implementation and Analysis of 3D Navier-Stokes Solvers

In this work we introduce PRIN-3D (PRoto-code for Internal flows modeled by Navier-Stokes equations in 3-Dimensions), a new high level algebraic language (Matlab$^®$) based code, by discussing some fundamental aspects regarding its basic solving kernel and by describing the design of an innovative advection scheme. The main focus was on designing a memory and computationally efficient code that, due to the typical conciseness of the Matlab coding language, could allow for fast and effective implementation of new models or algorithms. Innovative numerical methods are discussed in the paper. The pressure equation is derived with a quasi-segregation technique leading to an iterative scheme obtained within the framework of a global preconditioning procedure. Different levels of parallelization are obtainable by exploiting special pressure variable ordering patterns that lead to a block-structured Poisson-like matrix. Moreover, the new advection scheme has the potential of a controllable artificial diffusivity. Preliminary results are shown including a fully three-dimensional internal laminar flow evolving in a relatively complex geometry and a 3D methane-air flame simulated with the aid of libraries based on the Flamelet model.     

On some sets of dictionaries whose ω ‐powers have a given

A dictionary is a set of finite words over some finite alphabet X. The ω ‐power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [10] the complexity of the set of dictionaries whose associated ω ‐powers have a given complexity. In particular, he considered the sets ??( Σ ⁰k) (respectively, ??( Π ⁰_k), ??( Δ ¹₁)) of dictionaries V ? 2* whose ω ‐powers are Σ ⁰_k‐sets (respectively, Π ⁰_k‐sets, Borel sets). In this paper we first establish a new relation between the sets ??( Σ ⁰₂) and ??( Δ ¹₁), showing that the set ??( Δ ¹₁) is “more complex” than the set ??( Σ ⁰₂). As an application we improve the lower bound on the complexity of ??( Δ ¹₁) given by Lecomte, showing that ??( Δ ¹₁) is in Σ ¹ ₂(2^2*)\ Π ⁰₂. Then we prove that, for every integer k ≥ 2 (respectively, k ≥ 3), the set of dictionaries ??( Π ⁰_k+1) (respectively, ??( Σ ⁰_{k +1})) is “more complex” than the set of dictionaries ??( Π ⁰_k) (respectively, ??( Σ ⁰_k)) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

线性逻辑和态极逻辑引论(Ⅰ)

《线性逻辑和态极逻辑引论》一文概述了由Girard分别于1986和2001所创建的线性逻辑和态极逻辑.线性逻辑和态极逻辑汲取于计算机科学并反之应用于其中,从根本上对数理逻辑进行了彻底的审视.全文分为两部分.本文是文章的第一部分,致力于线性逻辑的联结词、证明规则、可判定性性质和模型.文章的第二部分将研究证明网并简要介绍态极逻辑.证明网是证明的图式表示,是线性逻辑的主要创新之一.     

Computer programming in the UK undergraduate mathematics curriculum

This paper reports a study which investigated the extent to which undergraduate mathematics students in the United Kingdom are currently taught to programme a computer as a core part of their mathematics degree programme. We undertook an online survey, with significant follow-up correspondence, to gather data on current curricula and received replies from 46 (63%) of the departments who teach a BSc mathematics degree. We found that 78% of BSc degree courses in mathematics included computer programming in a compulsory module but 11% of mathematics degree programmes do not teach programming to all their undergraduate mathematics students. In 2016, programming is most commonly taught to undergraduate mathematics students through imperative languages, notably MATLAB, using numerical analysis as the underlying (or parallel) mathematical subject matter. Statistics is a very popular choice in optional courses, using the package R. Computer algebra systems appear to be significantly less popular for compulsory first-year courses than a decade ago, and there was no mention of logic programming, functional programming or automatic theorem proving software. The modal form of assessment of computing modules is entirely by coursework (i.e. no examination).     

Generalized periodicity and primitivity for words

Starting from six kinds of periodicity of words we define six sets of words which are primitive in different senses and we investigate their relationships. We show that only three of the sets are external Marcus contextual languages with choice but none of them is an external contextual language without choice or an internal contextual language. For the time complexity of deciding any of our sets by one-tape Turing machines, n ² is a lower bound and this is optimal in two cases. The notions of roots and degrees of words and languages, which are strongly connected to periodicity and primitivity, are also considered, and we show that there can be an arbitrarily large gap between the complexity of a language and that of its roots. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Stochastic programming for optimizing bidding strategies of a Nordic hydropower producer

From the point of view of a price-taking hydropower producer participating in the day-ahead power market, market prices are highly uncertain. The present paper provides a model for determining optimal bidding strategies taking this uncertainty into account. In particular, market price scenarios are generated and a stochastic mixed-integer linear programming model that involves both hydropower production and physical trading aspects is developed. The idea is to explore the effects of including uncertainty explicitly into optimization by comparing the stochastic approach to a deterministic approach. The model is illustrated with data from a Norwegian hydropower producer and the Nordic power market at Nord Pool.