A coalgebraic take on regular and $\omega$-regular behaviours

We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad. The first part of the paper is devoted to presenting a construction of a monad suitable for modelling (in)finite behaviour. The second part of the paper focuses on presenting the concepts of a (coalgebraic) automaton and its ($\omega$-) behaviour. We end the paper with coalgebraic Kleene-type theorems for ($\omega$-) regular input. The framework is instantiated on non-deterministic (B\"uchi) automata, tree automata and probabilistic automata.

Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata

After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata: sublinear-time computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in the automaton. We prove a time hierarchy theorem for sublinear-time ACA classes, analyze their intersection with the regular languages, and, finally, establish strict inclusions in the parallel computation classes [Formula: see text] and (uniform) [Formula: see text]. As an addendum, we introduce and investigate the concept of a decider ACA (DACA) as a candidate for a decider counterpart to (acceptor) ACAs. We show the class of languages decidable in constant time by DACAs equals the locally testable languages, and we also determine [Formula: see text] as the (tight) time complexity threshold for DACAs up to which no advantage compared to constant time is possible.

Projection for Büchi Tree Automata with Constraints between Siblings

We consider an extension of tree automata on infinite trees that can use equality and disequality constraints between direct subtrees of a node. Recently, it has been shown that the emptiness problem for these kind of automata with a parity acceptance condition is decidable and that the corresponding class of languages is closed under Boolean operations. In this paper, we show that the class of languages recognizable by such tree automata with a Büchi acceptance condition is closed under projection. This construction yields a new algorithm for the emptiness problem, implies that a regular tree is accepted if the language is non-empty (for the Büchi condition), and can be used to obtain a decision procedure for an extension of monadic second-order logic with predicates for subtree comparisons.

On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs

Abstract Dialectical Frameworks (ADFs) are argumentation frameworks where each node is associated with an acceptance condition. This allows us to model different types of dependencies as supports and attacks. Previous studies provided a translation from Normal Logic Programs (NLPs) to ADFs and proved the stable models semantics for a normal logic program has an equivalent semantics to that of the corresponding ADF. However, these studies failed in identifying a semantics for ADFs equivalent to a three-valued semantics (as partial stable models and well-founded models) for NLPs. In this work, we focus on a fragment of ADFs, called Attacking Dialectical Frameworks (ADF+s), and provide a translation from NLPs to ADF+s robust enough to guarantee the equivalence between partial stable models, well-founded models, regular models, stable models semantics for NLPs and respectively complete models, grounded models, preferred models, stable models for ADFs. In addition, we define a new semantics for ADF+s, called L-stable, and show it is equivalent to the L-stable semantics for NLPs.

SUPPRESS OR ACCEPT? A PILOT STUDY TO EVALUATE THE EFFECT OF COPING STRATEGIES ON ERN AMPLITUDE AMONG INDIVIDUALS WITH OBSESSIVE-COMPULSIVE TRAITS

Intrusive thoughts are characteristic of psychological disorders; attempts to cope can become maladaptive perpetuating the problem (e.g., thought suppression), while others can provide long-term symptoms relief (e.g., acceptance). Although emerging research begins to explore the neural correlates of these strategies in healthy population, it is important to explore these strategies in populations more likely to naturally attempt to use such strategies (clinical symptoms). The present study explored if the use of cognitive strategies to manage intrusive cognitions would be differentially reflected in psychophysiological measures (i.e., error-related negativity) of individuals characterized by obsessive-compulsive symptoms -a group commonly associated with suppression efforts- relative to a low OC control. 67 participants with high and low OC symptoms were randomly assigned to cognitive strategy (suppression or acceptance). Participants watched an emotion-eliciting video clip and used the assigned cognitive strategy while performing the Stroop task. EEG data was collected. Consistent with well-established and emerging literature, ERN was enhanced in individuals with high OC symptoms and a marginal effect of thought-control strategy was observed, such that ERN amplitude was reduced in the suppression condition and greater for the acceptance condition. Uniquely, the study expanded on emerging literature by exploring whether the relationship between ERN and cognitive strategies was moderated by OC level. Although results were not conclusive, these preliminary findings represent an important first step to study effects of suppression and acceptance on the ERN in a sample characterized by clinically-relevant symptoms and overall encourage further exploration.

Body Image Distortion Following Social Rejection or Acceptance Cues

Introduction: Body image has been shown to be subject to explicit, body-related feedback influences, yet little attention has been paid to subtle feedback about overall social acceptability. The current study tested competing hypotheses regarding women's body image after being primed with cued social rejection or acceptance. Whereas sociometer theory predicts that women will perceive their bodies more negatively following a social rejection prime, self-enhancement theory predicts the opposite. Method: A total of 105 female undergraduate students underwent a conditioning procedure in which distinctive tones were paired with signs of social rejection or acceptance. After this, body distortion (measured by a participant-adjusted virtual image), self-reported body satisfaction and affect were measured, while one of the tones sounded repeatedly in the background. Results: Compared with the acceptance condition, rejection condition participants reported greater state negative affect, F(1, 103) = 4.41, p = .04, greater state positive affect, F(1, 103) = 5.52, p = .02, and perceived their bodies as being smaller, F(1, 103) = 6.53, p = .01, consistent with the expectations of self-enhancement theory. Discussion: Implications of these findings are discussed regarding improved understanding of body image disturbance as well as development of novel clinical treatments.

On the Strength of Unambiguous Tree Automata

This work is a study of the class of non-deterministic automata on infinite trees that are unambiguous i.e. have at most one accepting run on every tree. The motivating question asks if the fact that an automaton is unambiguous implies some drop in the descriptive complexity of the language recognised by the automaton. As it turns out, such a drop occurs for the parity index and does not occur for the weak parity index.More precisely, given an unambiguous parity automaton [Formula: see text] of index [Formula: see text], we show how to construct an alternating automaton [Formula: see text] which accepts the same language, but is simpler in terms of the acceptance condition. In particular, if [Formula: see text] is a Büchi automaton ([Formula: see text]) then [Formula: see text] is a weak alternating automaton. In general, [Formula: see text] belongs to the class [Formula: see text], what implies that it is simultaneously of alternating index [Formula: see text] and of the dual index [Formula: see text]. The transformation algorithm is based on a separation procedure of Arnold and Santocanale (2005).In the case of non-deterministic automata with the weak parity condition, we provide a separation procedure analogous to the one used above. However, as illustrated by examples, this separation procedure cannot be used to prove a complexity drop in the weak case, as there is no such drop.

The Development and Application of the Engineering and Design Analyzer of CAP1400 Nuclear Power Plant

In the process of research and development for a new nuclear power plant, it is very necessary to develop a dynamic platform and tools to analyze and verify the plant control & protect system and human factor engineering. Therefor, Shanghai Nuclear Engineering Research and Development Institute (SNERDI) developed the Engineering & Design Analyzer of CAP1400 Nuclear Power Plant (CAP1400 EDA) which provides a dynamic platform environment for analyzing and verifying the control system and human factor engineering of the CAP1400 nuclear power plant, a new Gen III passive nuclear power plant. In this paper, the mechanism and implement approach of the CAP1400 EDA will be mainly introduced, for example, the platform architecture of the EDA, analysis tools integrated in the EDA and CAP1400 nuclear power plant modes based on the EDA. In the meantime, a typical application case based on the CAP1400 EDA will be demonstrated in this paper, for example the capability of the NSSS control system will be verified in a ramp load down & raise operate transient. In this transient process, the NSSS control system of the plant is assessed whether it has the capability to keep the key parameter and state of the plant in an acceptance condition or range. And also other transients such as step load transient, large load transient can be simulated on CAP1400 EDA to verify whether or not the NSSS control systems are properly designed.