Sofic-Dyck shifts

We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Inoue, Krieger and Matsumoto. Sofic-Dyck shifts are shifts of sequences whose finite factors form unambiguous context-free languages. We show that they correspond exactly to the class of shifts of sequences whose sets of factors are visibly pushdown languages. We give an expression of the zeta function of a sofic-Dyck shift

Monitoring Penguins at Sea using Data Loggers

The activity of four penguin species at sea was studied using new data loggers. One unit was fixed to the bird's backs and recorded swim speed, swim heading and dive depth from which the three dimensional movements of the birds at sea could be constructed by vector calculations. This unit additionally recorded sea temperature and light intensity. A further, single-channel logger was ingested by the birds and recorded stomach temperature during the periods at sea. Drops in stomach temperature were indicative of prey capture and could be ascribed to specific localities

Fixed Point and Aperiodic Tilings

An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals) We present a new construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. The flexibility of this construction allows us to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. This property was not known for any of the existing aperiodic tile sets.Comment: v5: technical revision (positions of figures are shifted

Quasiperiodicity and non-computability in tilings

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the fixed point construction; we improve this general technique and make it enforce the property of local regularity of tilings needed for quasiperiodicity. We prove also a stronger result: any effectively closed set can be recursively transformed into a tile set so that the Turing degrees of the resulted tilings consists exactly of the upper cone based on the Turing degrees of the later.Comment: v3: the version accepted to MFCS 201

Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems

The operations drip and mate considered in (mem)brane computing resemble the operations cut and recombination well known from DNA computing. We here consider sets of vesicles with multisets of objects on their outside membrane interacting by drip and mate in two different setups: in test tube systems, the vesicles may pass from one tube to another one provided they fulfill specific constraints; in tissue-like P systems, the vesicles are immediately passed to specified cells after having undergone a drip or mate operation. In both variants, computational completeness can be obtained, yet with different constraints for the drip and mate operations

First records of two mealybug species in Brazil and new potential pests of papaya and coffee

Five mealybug (Hemiptera: Pseudococcidae) plant pest species: Dysmicoccus grassii (Leonardi), Ferrisia malvastra (McDaniel), Ferrisia virgata (Cockerell), Phenacoccus tucumanus Granara de Willink, and Pseudococcus elisae Borchsenius are recorded for the first time in the state of Espírito Santo, Brazil. These are the first records of D. grassii in Brazil, from papaya (Carica papaya, Caricaceae), and from coffee (Coffea canephora, Rubiaceae). Ferrisia malvastra is also newly recorded in Brazil, where it was found on Bidens pilosa (Asteraceae). Ferrisia virgata was collected from an unidentified weed and Phenacoccus tucumanus from Citrus sp. (Rutaceae). Plotococcus capixaba Kondo was found on pitanga (Eugenia cf. pitanga, Myrtaceae) and Pseudococcus elisae on Coffea canephora, which are new host records for these mealybugs

The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable

It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs

Microstructural enrichment functions based on stochastic Wang tilings

This paper presents an approach to constructing microstructural enrichment functions to local fields in non-periodic heterogeneous materials with applications in Partition of Unity and Hybrid Finite Element schemes. It is based on a concept of aperiodic tilings by the Wang tiles, designed to produce microstructures morphologically similar to original media and enrichment functions that satisfy the underlying governing equations. An appealing feature of this approach is that the enrichment functions are defined only on a small set of square tiles and extended to larger domains by an inexpensive stochastic tiling algorithm in a non-periodic manner. Feasibility of the proposed methodology is demonstrated on constructions of stress enrichment functions for two-dimensional mono-disperse particulate media.Comment: 27 pages, 12 figures; v2: completely re-written after the first revie

Modular Descriptions of Regular Functions

We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one may use more human friendly descriptions based on some simple basic transformations (e.g., copy, duplicate, erase, reverse) and various combinators such as function composition or extensions of regular operations.Comment: preliminary version appeared in CAI 2019, LNCS 1154