Deterministic recognizability of picture languages with Wang automata

special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ApplicationsInternational audienceWe present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacent one, according to some scanning strategy. Wang automata recognize the class REC, i.e. they are equivalent to tiling systems or online tessellation acceptors, and hence strictly more powerful than 4-way automata. We also introduce a natural notion of determinism for Wang automata, and study the resulting class, extending the more traditional approach of diagonal-based determinism, used e. g. by deterministic tiling systems. In particular, we prove that the concept of row (or column) ambiguity defines the class of languages recognized by Wang automata directed by boustrophedonic scanning strategies

Strategies to scan pictures with automata based on Wang tiles

Wang automata are devices for picture language recognition recently introduced by us, which characterize the class REC of recognizable picture languages. Thus, Wang automata are equivalent to tiling systems or online tessellation acceptors, and are based like Wang systems on labeled Wang tiles. The present work focus on scanning strategies, to prove that the ones Wang automata are based on are those following four kinds of movements: boustrophedonic, ``L-like'', ``U-like'', and spirals

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

Behaviour of NBD-head group labelled phosphatidylethanolamines in POPC bilayers: a molecular dynamics study

A complete homologous series of fluorescent phosphatidylethanolamines (diCnPE), labelled at the head group with a 7-nitrobenz-2-oxa-1,3-diazo-4-yl(NBD) fluorophore and inserted in 1-palmitoyl, 2-oleoyl-snglycero- 3-phosphocholine (POPC) bilayers, was studied using atomistic molecular dynamics simulations. The longer-chained derivatives of NBD-diCnPE, with n = 14, 16, and 18, are commercially available, and widely used as fluorescent membrane probes. Properties such as location of atomic groups and acyl chain order parameters of both POPC and NBD-diCnPE, fluorophore orientation and hydrogen bonding, membrane electrostatic potential and lateral diffusion were calculated for all derivatives in the series. Most of these probes induce local disordering of POPC acyl chains, which is on the whole counterbalanced by ordering resulting from binding of sodium ions to lipid carbonyl/glycerol oxygen atoms. An exception is found for NBD-diC16PE, which displays optimal matching with POPC acyl chain length and induces a slight local ordering of phospholipid acyl chains. Compared to previously studied fatty amines, acyl chain-labelled phosphatidylcholines, and sterols bearing the same fluorescent tag, the chromophore in NBD-diCnPE locates in a similar region of the membrane (near the glycerol backbone/carbonyl region) but adopts a different orientation (with the NO2 group facing the interior of the bilayer). This modification leads to an inverted orientation of the P–N axis in the labelled lipid, which affects the interface properties, such as the membrane electrostatic potential and hydrogen bonding to lipid head group atoms. The implications of this study for the interpretation of the photophysical properties of NBD-diCnPE (complex fluorescence emission kinetics, differences with other NBD lipid probes) are discussed

Sanakielet ja lokaalisuus

In this master's thesis we study the generalization of word languages into multi-dimensional arrays of letters i.e picture languages. Our main interest is the class of recognizable picture languages which has many properties in common with the robust class of regular word languages. After surveying the basic properties of picture languages, we present a logical characterization of recognizable picture languages—a generalization of Büchi's theorem of word languages into pictures, namely that the class of recognizable picture languages is the one recognized by existential monadic second-order logic. The proof presented is a recent one that makes the relation between tilings and logic clear in the proof. By way of the proof we also study the locality of the model theory of picture structures through logical locality obtained by normalization of EMSO on those structures. A continuing theme in the work is also to compare automata and recognizability between word and picture languages. In the fourth section we briefly look at topics related to computativity and computational complexity of recognizable picture languages

Proceedings of the Eindhoven FASTAR Days 2004 : Eindhoven, The Netherlands, September 3-4, 2004

The Eindhoven FASTAR Days (EFD) 2004 were organized by the Software Construction group of the Department of Mathematics and Computer Science at the Technische Universiteit Eindhoven. On September 3rd and 4th 2004, over thirty participants|hailing from the Czech Republic, Finland, France, The Netherlands, Poland and South Africa|gathered at the Department to attend the EFD. The EFD were organized in connection with the research on finite automata by the FASTAR Research Group, which is centered in Eindhoven and at the University of Pretoria, South Africa. FASTAR (Finite Automata Systems|Theoretical and Applied Research) is an in- ternational research group that aims to lead in all areas related to finite state systems. The work in FASTAR includes both core and applied parts of this field. The EFD therefore focused on the field of finite automata, with an emphasis on practical aspects and applications. Eighteen presentations, mostly on subjects within this field, were given, by researchers as well as students from participating universities and industrial research facilities. This report contains the proceedings of the conference, in the form of papers for twelve of the presentations at the EFD. Most of them were initially reviewed and distributed as handouts during the EFD. After the EFD took place, the papers were revised for publication in these proceedings. We would like to thank the participants for their attendance and presentations, making the EFD 2004 as successful as they were. Based on this success, it is our intention to make the EFD into a recurring event. Eindhoven, December 2004 Loek Cleophas Bruce W. Watso