60 research outputs found
Sticker systems over monoids
Molecular computing has gained many interests among researchers since Head introduced the first theoretical model for DNA based computation using the splicing operation in 1987. Another model for DNA computing was proposed by using the sticker operation which Adlemanused in his successful experiment for the computation of Hamiltonian paths in a graph: a double stranded DNA sequence is composed by prolonging to the left and to the right a sequence of (single or double) symbols by using given single stranded strings or even more complex dominoes with sticky ends, gluing these ends together with the sticky ends of the current sequence according to a complementarity relation. According to this sticker operation, a language generative mechanism, called a sticker system, can be defined: a set of (incomplete) double-stranded sequences (axioms) and a set of pairs of single or double-stranded complementary sequences are given. The initial sequences are prolonged to the left and to the right by using sequences from the latter set, respectively. The iterations of these prolongations produce “computations” of possibly arbitrary length. These processes stop when a complete double stranded sequence is obtained. Sticker systems will generate only regular languages without restrictions. Additional restrictions can be imposed on the matching pairs of strands to obtain more powerful languages. Several types of sticker systems are shown to have the same power as regular grammars; one type is found to represent all linear languages whereas another one is proved to be able to represent any recursively enumerable language. The main aim of this research is to introduce and study sticker systems over monoids in which with each sticker operation, an element of a monoid is associated and a complete double stranded sequence is considered to be valid if the computation of the associated elements of the monoid produces the neutral element. Moreover, the sticker system over monoids is defined in this study
A cut-invariant law of large numbers for random heaps
Heap monoids equipped with Bernoulli measures are a model of probabilistic
asynchronous systems. We introduce in this framework the notion of asynchronous
stopping time, which is analogous to the notion of stopping time for classical
probabilistic processes. A Strong Bernoulli property is proved. A notion of
cut-invariance is formulated for convergent ergodic means. Then a version of
the Strong law of large numbers is proved for heap monoids with Bernoulli
measures. Finally, we study a sub-additive version of the Law of large numbers
in this framework based on Kingman sub-additive Ergodic Theorem.Comment: 29 pages, 3 figures, 21 reference
Automaton semigroups: new construction results and examples of non-automaton semigroups
This paper studies the class of automaton semigroups from two perspectives:
closure under constructions, and examples of semigroups that are not automaton
semigroups. We prove that (semigroup) free products of finite semigroups always
arise as automaton semigroups, and that the class of automaton monoids is
closed under forming wreath products with finite monoids. We also consider
closure under certain kinds of Rees matrix constructions, strong semilattices,
and small extensions. Finally, we prove that no subsemigroup of arises as an automaton semigroup. (Previously, itself was
the unique example of a finitely generated residually finite semigroup that was
known not to arise as an automaton semigroup.)Comment: 27 pages, 6 figures; substantially revise
Markovian dynamics of concurrent systems
Monoid actions of trace monoids over finite sets are powerful models of
concurrent systems---for instance they encompass the class of 1-safe Petri
nets. We characterise Markov measures attached to concurrent systems by
finitely many parameters with suitable normalisation conditions. These
conditions involve polynomials related to the combinatorics of the monoid and
of the monoid action. These parameters generalise to concurrent systems the
coefficients of the transition matrix of a Markov chain.
A natural problem is the existence of the uniform measure for every
concurrent system. We prove this existence under an irreducibility condition.
The uniform measure of a concurrent system is characterised by a real number,
the characteristic root of the action, and a function of pairs of states, the
Parry cocyle. A new combinatorial inversion formula allows to identify a
polynomial of which the characteristic root is the smallest positive root.
Examples based on simple combinatorial tilings are studied.Comment: 35 pages, 6 figures, 33 reference
Characterizations of recognizable picture series
AbstractThe theory of two-dimensional languages as a generalization of formal string languages was motivated by problems arising from image processing and pattern recognition, and also concerns models of parallel computing. Here we investigate power series on pictures. These are functions that map pictures to elements of a semiring and provide an extension of two-dimensional languages to a quantitative setting. We assign weights to different devices, ranging from picture automata to tiling systems. We will prove that, for commutative semirings, the behaviours of weighted picture automata are precisely alphabetic projections of series defined in terms of rational operations, and also coincide with the families of series characterized by weighted tiling or weighted domino systems
- …