Effective constructions of grammars
Elastic wave propagation in parallel: the Huygens' approach.
The use of parallel computers makes it feasible to simulate elastic waves throughout large heterogeneous structures, and new domain decomposition methods can be used to increase their efficiency and decrease the computing time spent in the simulation. In this paper we introduce a simple parallel algorithm for the propagation of elastic waves in complex heterogeneous media after a finite element discretization. This method performs more efficiently than classic domain decomposition techniques based...
Enumerated type semantics for the calculus of looping sequences
The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure and...
Enumerated type semantics for the calculus of looping sequences
The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure...
Epsilon weak precedence grammars and languages
E-unification by means of tree tuple synchronized grammars.
Extending regular expressions with homomorphic replacement
We define H- and EH-expressions as extensions of regular expressions by adding homomorphic and iterated homomorphic replacement as new operations, resp. The definition is analogous to the extension given by Gruska in order to characterize context-free languages. We compare the families of languages obtained by these extensions with the families of regular, linear context-free, context-free, and EDT0L languages. Moreover, relations to language families based on patterns, multi-patterns,...