An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.     

Marcus contextual languages consisting of primitive words

In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars.     

Deterministic one-dimensional cellular automata

A formal treatment of some of the properties of deterministic, rule 150, elementary one-dimensional cellular automata (CA) with null boundary conditions is presented. The general form of the characteristic polynomial of the CA global rule transition matrix is obtained. Mathematical relationships between the CA register lengths and the order of the corresponding group or semigroup structures are derived.     

Time-constrained temporal logic control of multi-affine systems

In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on estimating the time bounds for facet reachability problems and solving a time optimal reachability problem on the product between a weighted transition system and an automaton that enforces the satisfaction of the specification. A random optimization algorithm is used to iteratively improve the solution.     

Coordination through De Bruijn sequences

Let (x_t) be an n-periodic sequence in which the first n elements are drawn i.i.d. according to some rational distribution. We prove there exists a constant C such that whenever mlnm?Cn, with probability close to 1, there exists an automaton of size m that matches the sequence at almost all stages.     

Automation and group structures in certain economic adjustment mechanisms

It is shown that the economic adjustment mechanism developed by Hurwicz and his associates has the structure of automata. It is then shown that certain price adjustment mechanisms, having an acceptability condition, impose a group structure upon the automaton. This condition is a bilinear invariance implied by a budget constraint. Then the automaton is defined by a subgroup, depending on agents' tastes, technologies and strategies, and by the representations of the subgroup imposed by the automaton.     

模糊有限自动机两个算子的若干性质

在文[1]定义了模糊有限自动机的bifuzzy seccessor算子和bifuzzy source算子的基础上,着重研究它们之间的基本性质及关系,并得到几个重要的性质定理。     

Critical behavior of sandpile vortices under variable charge

In the following, we consider a sandpile cellular automaton model (height version), which also takes account of lattice cyclicity for variable charge of grains projected upon the board. The size of the charge or additional grains of sand used to upset the equilibrium and to induce an avalanche is found to affect the distributional forms and in particular the convergence of the estimate for the dynamic exponent. Exponent estimates show slow variation with lattice dimensionL and some evidence of evolution with charge. The scaling region is limited in all cases with noisy decay at all levels of charge. Results presented extend the work of Duarte and Goncalves (1990) on the triangular lattice.     

Martensitic transformations: from continuum mechanics to spin models and automata

We present a new procedure for the systematic reduction of a continuum theory of martensitic transformations to a spin system whose dynamics can be described by an automaton. Our prototypical model reproduces most of the experimental observations in martensites associated with criticality and power-law acoustic emission. In particular, it explains in a natural way why cyclic training is necessary to reach scale-free behavior.      

New Design for Quantum Dots Cellular Automata to obtain Fault Tolerant Logic Gates

In this paper, we analyze fault tolerance properties of the Majority Gate, as the main logic gate for implementation with Quantum dots Cellular Automata (QCA), in terms of fabrication defect. Our results demonstrate the poor fault tolerance properties of the conventional design of Majority Gate and thus the difficulty in its practical application. We propose a new approach to the design of QCA-based Majority Gate by considering two-dimensional arrays of QCA cells rather than a single cell for the design of such a gate. We analyze fault tolerance properties of such Block Majority Gates in terms of inputs misalignment and irregularity and defect (missing cells) in assembly of the array. We present simulation results based on semiconductor implementation of QCA with an intermediate dimensional dot of about 5 nm in size as opposed to magnetic dots of greater than 100 nm or molecular dots of 2–5Å. Our results clearly demonstrate the superior fault tolerance properties of the Block Majority Gate and its greater potential for a practical realization. We also show the possibility of designing fault tolerant QCA circuits by using Block Majority Gates.