On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

When Does a Polynomial Over a Finite Field Permute the Elements of the Field?

We present a class of indecomposable polynomials of non prime-power degree over the finite field of two elements which are permutation polynomials on infinitely many finite extensions of the field. The associated geometric monodromy groups are the simple ...

on a class of pseudorandom sequences from elliptic curves over finite fields

Following the idea of Xing et al., we investigate a general method for constructing families of pseudorandom sequences with low correlation and large linear complexity from elliptic curves over finite fields in this correspondence. With the help of the tool of exponential sums on elliptic curves, we study their periods, linear complexities, linear complexity profiles, distributions of r-patterns, periodic correlation, partial period distributions, and aperiodic correlation in detail. The results show that they have nice randomness.

automatic construction of finite algebras

This paper deals withmodel generation for equational theories, i.e., automatically generating (finite) models of a given set of (logical) equations. Our method of finite model generation and a tool for automatic construction of finite algebras is described. Some examples are given to show the applications of our program. We argue that, the combination of model generators and theorem provers enables us to get a better understanding of logical theories. A brief comparison between our tool and other similar tools is also presented.

constructing finite algebras with falcon

The generation of models and counterexamples is an important form of reasoning. In this paper, we give a formal account of a system, called FALCON, for constructing finite algebras from given equational axioms. The abstract algorithms, as well as some implementation details and sample applications, are presented. The generation of finite models is viewed as a constraint satisfaction problem, with ground instances of the axioms as constraints. One feature of the system is that it employs a very simple technique, called the least number heuristic, to eliminate isomorphic (partial) models, thus reducing the size of the search space. The correctness of the heuristic is proved. Some experimental data are given to show the performance and applications of the system.

Controllable negative and positive group delay in transmission through a single quantum well at finite magnetic fields

We investigate the controllable negative and positive group delay in transmission through a single quantum well at the finite longitudinal magnetic fields. It is shown that the magneto-coupling effect between the longitudinal motion component and the transverse Landau orbits plays an important role in the group delay. The group delay depends not only on the width of potential well and the incident energy, but also on the magnetic-field strengthen and the Landau quantum number. The results show that the group delay can be changed from positive to negative by the modulation of the magnetic field. These interesting phenomena may lead to the tunable quantum mechanical delay line. (c) 2007 Elsevier B.V. All rights reserved.

Analysis of Si/GaAs Bonding Stresses with the Finite Element Method

In conjunction with ANSYS, we use the finite element method to analyze the bonding stresses of Si/GaAs. We also apply a numerical model to investigate a contour map and the distribution of normal stress,shearing stress,and peeling stress,taking into full consideration the thermal expansion coefficient as a function of temperature. Novel bonding structures are proposed for reducing the effect of thermal stress as compared with conventional structures. Calculations show the validity of this new structure.

Elastic Strain Field Distribution of a Self-Organized Growth Lensed-Shaped Quantum Dot by Finite Element Method

The stress and strain fields in self-organized growth coherent quantum dots (QD) structures are investigated in detail by two-dimension and three-dimension finite element analyses for lensed-shaped QDs. The nonobjective isolate quantum dot system is used. The calculated results can be directly used to evaluate the conductive band and valence band confinement potential and strain introduced by the effective mass of the charge carriers in strain QD.