A FINITE AXIOMATISATION OF FINITE-STATE AUTOMATA USING STRING DIAGRAMS

We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks

Uso de meios alternativos para produção de bioenseticida a base de Bacillus thuringiensis.

IX SINCOBIOL

Non‑intact Families and Children’s Educational Outcomes: Comparing Native and Migrant Pupils

This study explores whether the association between living in a single-parent household and children’s educational outcomes differs by migration background through comparing natives with first- and second-generation migrant children from different areas of origin. While there is strong evidence of an educational gap between migrant and native pupils in Western countries—and particularly in Italy—the interaction with family structure has been under-investigated. We suggest that native children have more socioeconomic resources to lose as a consequence of parental breakups, and thus may experience more negative consequences from living in a single-parent household compared to migrant children, who tend to have poorer educational outcomes regardless of family disruptions. Moreover, for migrant children, family disruption could result from parents’ migratory project (transnationalism) rather than separation or divorce, thus not necessarily implying parental conflict and a deteriorating family environment. Empirical analyses of data from the ISTAT ‘Integration of the Second Generation’ survey (2015) show that native Italian pupils from single-parent households in lower secondary schools are more strongly penalised in terms of grades, and less likely to aspire to the most prestigious upper secondary tracks when compared to second- and, especially, first-generation children. Indeed, the latter have been found to experience virtually no negative consequences from parental absence. Contrary to expectations, we found no substantial differences in the non-intact penalty based on the reason for parental absence (transnationalism vs divorce), nor by migrants’ area of origin

String Diagram Rewriting Modulo Commutative (Co)Monoid Structure

String diagrams constitute an intuitive and expressive graphical syntax that has found application in a very diverse range of fields including concurrency theory, quantum computing, control theory, machine learning, linguistics, and digital circuits. Rewriting theory for string diagrams relies on a combinatorial interpretation as double-pushout rewriting of certain hypergraphs. As previously studied, there is a “tension” in this interpretation: in order to make it sound and complete, we either need to add structure on string diagrams (in particular, Frobenius algebra structure) or pose restrictions on double-pushout rewriting (resulting in “convex” rewriting). From the string diagram viewpoint, imposing a full Frobenius structure may not always be natural or desirable in applications, which motivates our study of a weaker requirement: commutative monoid structure. In this work we characterise string diagram rewriting modulo commutative monoid equations, via a sound and complete interpretation in a suitable notion of double-pushout rewriting of hypergraphs

Bialgebraic foundations for the operational semantics of string diagrams

Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as a monad) and its dynamics (an endofunctor). This setup is instrumental in showing that a semantic specification (a coalgebra) is compositional. In this work, we use the bialgebraic approach to derive well-behaved structural operational semantics of string diagrams, a graphical syntax that is increasingly used in the study of interacting systems across different disciplines. Our analysis relies on representing the two-dimensional operations underlying string diagrams in various categories as a monad, and their semantics as a distributive law for that monad. As a proof of concept, we provide bialgebraic semantics for a versatile string diagrammatic language which has been used to model both signal flow graphs (control theory) and Petri nets (concurrency theory)

Posterior wiring with sublaminar polyester bands, titanium-peek fixation system for C2 fracture management: a 4-patient case series with a maximum of 18 months’ follow-up

Background: C2 fractures can be classified differently when dens, pedicles or body are injured. With regards to the best management of Type-II Anderson-D’Alonzo fractures, Hangman’s fractures of pedicles and C2 body fractures are more debatable. However, vertebral pedicle and/or articular screw and dorsal wiring are the most common surgical posterior approaches opted for. Compared to the screw technique, dorsal wiring provides certain benefits such as a lower risk of vertebral artery injury, no need for navigation, less lateral dissection of the paraspinal muscles, shorter surgery time and lower medical costs. Case Description: Two patients with failed conservative treatment for Anderson-D’Alonzo Type-III fractures (Cases 1A and 1B), a patient suffering from a Type-II Hangman’s fracture (Case 2) and a patient with failed conservative treatment for a C2 transversal body fracture (Case 3) underwent surgery at the Neurosurgery Division of the University Hospital of Modena (Italy) between July 2020 and September 2021. All patients were treated with posterior wiring with 5 mm Polyester bands, titanium-peek fixation system (Jazz-Lock system MediNext®-Implanet) inserted through the C1 posterior arch and either the C2 or C3 laminae. A fracture diastasis reduction was observed ranging between 4.5 and 1 mm. No intraoperative and post-operative complications were encountered. The duration of the period of hospitalisation ranged between 5 and 12 days. All patients who had worked prior to the traumatic event were able to return to work 18 months following surgery. Conclusions: In reducing C2 fractures, a sublaminar fixation with polyester bands and a titanium-peek fixation system can be proposed for fragile and elderly patients

String diagram rewrite theory II: rewriting with symmetric monoidal structure

Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are replaced by string diagrams, topological entities that can be intuitively thought of as diagrams of wires and boxes. Recently, string diagrams have become increasingly popular as a graphical syntax to reason about computational models across diverse fields, including programming language semantics, circuit theory, quantum mechanics, linguistics, and control theory. In applications, it is often convenient to implement the equations appearing in SMTs as rewriting rules. This poses the challenge of extending the traditional theory of term rewriting, which has been developed for algebraic theories, to string diagrams. In this paper, we develop a mathematical theory of string diagram rewriting for SMTs. Our approach exploits the correspondence between string diagram rewriting and double pushout (DPO) rewriting of certain graphs, introduced in the first paper of this series. Such a correspondence is only sound when the SMT includes a Frobenius algebra structure. In the present work, we show how an analogous correspondence may be established for arbitrary SMTs, once an appropriate notion of DPO rewriting (which we call convex) is identified. As proof of concept, we use our approach to show termination of two SMTs of interest: Frobenius semi-algebras and bialgebras

Uso de meios alternativos para a produção de bioinseticidas à base de Bacillus thuringiensis.

bitstream/CNPMS/18416/1/Circ_60.pd

Rewriting modulo symmetric monoidal structure

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and control theory.An important role in many such approaches is played by equational theories of diagrams, typically oriented and applied as rewrite rules. This paper lays a comprehensive foundation for this form of rewriting. We interpret diagrams combinatorially as typed hypergraphs and establish the precise correspondence between diagram rewriting modulo the laws of SMCs on the one hand and double pushout (DPO) rewriting of hypergraphs, subject to a soundness condition called convexity, on the other. This result rests on a more general characterisation theorem in which we show that typed hypergraph DPO rewriting amounts to diagram rewriting modulo the laws of SMCs with a chosen special Frobenius structure.We illustrate our approach with a proof of termination for the theory of non-commutative bimonoids