Search

Plants are capable of a range of complex interactions with the environment. Over the last decade, some authors have used this as evidence to argue that plants are cognitive agents. While there is no consensus on this view, it is certainly interesting to approach the debate from a comparative perspective, trying to understand whether different lineages of plants show different degrees of responsiveness to environmental cues, and how their responses compare with those of animals or humans. In this paper, I suggest that a potentially fruitful approach to these comparative studies is provided by automata theory. Accordingly, I shall present a possible application of this theory to plant communication. Two tentative results will emerge. First, that different lineages may exhibit different levels of complexity in response to similar stimuli. Second, that current evidence does not allow to infer great cognitive sophistication in plants. [ABSTRACT FROM AUTHOR]

This paper addresses fault pattern diagnosis of discrete event systems, involving fault pattern detection and diagnosability. A fault pattern is modelled as a finite automaton whose accepted language is the objective to be diagnosed, representing the occurrence of complex or composite faults. A verifier for fault pattern detection based on the synchronous product of a system and a fault pattern is proposed. By removing all silent events, a silent closure is calculated based on the synchronous product, which offers computational advantages for systems that have a large number of silent events. An NSC/FSC pair verifier is then computed by taking the product of a normal silent closure and an accepted silent closure. By studying indeterminate cycles of the NSC/FSC pair verifier, necessary and sufficient verification conditions are established, asserting that a system is diagnosable with respect to a fault pattern if and only if there is no indeterminate cycle in the NSC/FSC pair verifier. It is shown that the proposed method requires polynomial time at most. Finally, a case study to illustrate the results is provided. [ABSTRACT FROM AUTHOR]

High-performance computers are used for computation-intensive tasks. It is essential for these systems to simultaneously execute several computation-intensive tasks for efficient and timely system utilization. Since typical tasks have a longer runtime, it is essential to determine the runtime of each task prior to execution and schedule them accordingly. We propose a method for predicting the runtime of MPI-based software. Initially, we analyze the source code of the software by translating the code to finite automata and measuring the state complexity. Next, the runtime of software is trained using a deep neural network (DNN) along with its state complexity. Herein, we propose three models based on DNN, statistics and their hybrid. DNN model is superior in comparison. Additionally, the adaptability of our method is demonstrated by showing that our method can adapt on new environment with 90% accuracy on various software. [ABSTRACT FROM AUTHOR]

Abstract With the emergence of powerful and low‐energy Internet of Things devices, deep learning computing is increasingly applied to resource‐constrained edge devices. However, the mismatch between hardware devices with low computing capacity and the increasing complexity of Deep Neural Network models, as well as the growing real‐time requirements, bring challenges to the design and deployment of deep learning models. For example, autonomous driving technologies rely on real‐time object detection of the environment, which cannot tolerate the extra latency of sending data to the cloud, processing and then sending the results back to edge devices. Many studies aim to find innovative ways to reduce the size of deep learning models, the number of Floating‐point Operations per Second, and the time overhead of inference. Neural Architecture Search (NAS) makes it possible to automatically generate efficient neural network models. The authors summarise the existing NAS methods on resource‐constrained devices and categorise them according to single‐objective or multi‐objective optimisation. We review the search space, the search algorithm and the constraints of NAS on hardware devices. We also explore the challenges and open problems of hardware NAS.

We introduce an n-state Game of Life (GoL) on a cellular array (cells indexed by (i, j)), where each state σ = 0, ..., n − 1 has a nominal values vσ ≥ 0. The game involves computing the sum of the state values of the eight cells that surround cell (i, j) and using this sum to determine whether cell (i, j) stays in state σ, progress to state σ + 1, or reverts at state 0. We illustrate examples of this game, identifying still-life, oscillator, glider, and replicator patterns, as well as the long term behavior arising from random and regular starting configurations. Importantly, we provide two freely downloadable application programs that can be used to explore the behavior of the three and four state GoLs discussed in this paper [ABSTRACT FROM AUTHOR]

The Declare process modeling language has been established within the research community for modeling so-called flexible processes. Declare follows the declarative modeling paradigm and therefore guarantees flexible process execution. For several reasons, declarative process models turned out to be hard to read and comprehend. Thus, it is also hard to decide whether two process models are equal with respect to their semantic meaning, whether one model is completely contained in another one or how far two models overlap. In this paper, we follow an automaton-based approach by transforming Declare process models into finite state automatons and applying automata theory for solving this issue. [ABSTRACT FROM AUTHOR]

String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the past few years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and cybersecurity. This article reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the past few decades to solve string constraints. [ABSTRACT FROM AUTHOR]

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about presentations of sofic shifts, such as whether a given graph presents a shift of finite type, or an irreducible shift; whether one graph presents a subshift of another; and whether a given presentation is minimal, or has a synchronizing word. Leveraging connections to automata theory, we first observe that these problems are all decidable in polynomial time when the given presentation is irreducible (strongly connected), via algorithms both known and novel to this work. For the general (reducible) case, however, we show they are all PSPACE -complete. All but one of these problems (subshift) remain polynomial-time solvable when restricting to synchronizing deterministic presentations. We also study the size of synchronizing words and synchronizing deterministic presentations. [ABSTRACT FROM AUTHOR]

Nominal automata are models for recognising languages over infinite alphabets, based on the algebraic notion of nominal set. Motivated by their use in automata theory, we show how to compute efficiently with nominal sets over the so-called total order symmetry , a variant which allows to compare alphabet letters for equality as well as their respective order. We develop an explicit finite representation of such nominal sets and basic constructions thereon. The approach is implemented as the library Ons (Ordered Nominal Sets), enabling programming with infinite sets. Returning to our motivation of nominal automata, we evaluate Ons in two applications: minimisation of automata and active automata learning. In both cases, Ons is competitive compared to existing implementations and outperforms them for certain classes of inputs. [ABSTRACT FROM AUTHOR]

The Nottingham group at 2 is the group of (formal) power series t + a 2 t 2 + a 3 t 3 + ⋯ in the variable t with coefficients a i from the field with two elements, where the group operation is given by composition of power series. The depth of such a series is the largest d ⩾ 1 for which a 2 = ... = a d = 0. Only a handful of power series of finite order (forcedly a power of 2) are explicitly known through a formula for their coefficients. We argue in this paper that it is advantageous to describe such series in closed computational form through automata, based on effective versions of proofs of Christol's theorem identifying algebraic and automatic series. Up to conjugation, there are only finitely many series σ of order 2 n with fixed break sequence (i.e. the sequence of depths of σ ∘ 2 i ). Starting from Witt vector or Carlitz module constructions, we give an explicit automaton-theoretic description of: (a) representatives up to conjugation for all series of order 4 with break sequence (1 , m) for m < 10 ; (b) representatives up to conjugation for all series of order 8 with minimal break sequence (1 , 3 , 11) ; and (c) an embedding of the Klein four-group into the Nottingham group at 2. We study the complexity of the new examples from the algebro-geometric properties of the equations they satisfy. For this, we generalise the theory of sparseness of power series to a four-step hierarchy of complexity, for which we give both Galois-theoretic and combinatorial descriptions. We identify where our different series fit into this hierarchy. We construct sparse representatives for the conjugacy class of elements of order two and depth 2 μ ± 1 (μ ⩾ 1). Series with small state complexity can end up high in the hierarchy. This is true, for example, for a new automaton we found, representing a series of order 4 with 5 states (the minimal possible number for such a series). [ABSTRACT FROM AUTHOR]

We address the following decision problem. Given a numeration system U and a U-recognizable set X ⊆ ℕ , i.e. the set of its greedy U-representations is recognized by a finite automaton, decide whether or not X is ultimately periodic. We prove that this problem is decidable for a large class of numeration systems built on linear recurrence sequences. Based on arithmetical considerations about the recurrence equation and on p-adic methods, the DFA given as input provides a bound on the admissible periods to test. [ABSTRACT FROM AUTHOR]

Abstract Visual simultaneous localization and mapping (vSLAM), one of the most important applications in autonomous vehicles and robots to estimate the position and pose using inexpensive visual sensors, suffers from error accumulation for long‐term navigation without loop closure detection. Recently, deep neural networks (DNNs) are leveraged to achieve high accuracy for loop closure detection, however the execution time is much slower than those employing handcrafted visual features. In this paper, a parallel loop searching and verifying method for loop closure detection with both high accuracy and high speed, which combines two parallel tasks using handcrafted and DNN features, respectively, is proposed. A fast loop searching is proposed to link the bag‐of‐words features and histogram for higher accuracy, and it splits the images into multiple grids for high parallelism; meanwhile, a DNN feature extractor is utilized for further verification. A loop state control method based on a finite state machine to control these tasks is designed, wherein the loop closure detection is described as a context‐related procedure. The framework is implemented on a real machine, and the top‐2 best accuracy and fastest execution time of 80‐543 frames per second (min: 1.84ms, and max: 12.45ms) are achieved on several public benchmarks compared with some existing algorithms.

String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the past few years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and cybersecurity. This article reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the past few decades to solve string constraints. [ABSTRACT FROM AUTHOR]

Simulation‐based learning tools have become commonly used at all levels of education. They are recognized as an effective means of studying complex and abstract systems. In traditional teaching of compiler concepts, students are incapable of visualizing theoretical constructions, while the use of simulation systems represents an excellent blend of theoretical and practical experience. This paper describes a software system for visualization and simulation of basic compiler concepts and algorithms. The simulation tool enables students to visualize the operation of finite automata, convert a regular expression into deterministic finite automata (DFA) or nondeterministic finite automata, and simulate Thompson's construction algorithm. The process of constructing the LL(0) and LR(1) parsing tables is represented as a step‐by‐step simulation, with the user receives feedback on the correctness of each step before moving on to the next. The system is capable of calculating the FIRST and FOLLOW sets, graphically representing DFA, and constructing the corresponding parsing table. This tool provides a module for visualizing the process of machine code generation. [ABSTRACT FROM AUTHOR]

A key component of blockchain technology is the ledger, viz., a database that, unlike standard databases, keeps in memory the complete history of past transactions as in a notarial archive for the benefit of any future test. In second-generation blockchains such as Ethereum, the ledger is coupled with smart contracts, which enable the automation of transactions associated with agreements between the parties of a financial or commercial nature. The coupling of smart contracts and ledgers provides the technological background for very innovative application areas, such as Decentralized Autonomous Organizations (DAOs), Initial Coin Offerings (ICOs), and Decentralized Finance (DeFi), which propelled blockchains beyond cryptocurrencies that were the only focus of first generation blockchains, such as Bitcoin. However, the currently used implementation of smart contracts as arbitrary programming constructs has made them susceptible to dangerous bugs that can be exploited maliciously and has moved their semantics away from that of legal contracts. We propose here to recompose the split and recover the reliability of databases by formalizing a notion of contract modeled as a finite-state automaton with well-defined computational characteristics derived from encoding in terms of allocations of resources to actors, as an alternative to the approach based on programming. To complete the work, we use temporal logic as the basis for an abstract query language that is effectively suited to the historical nature of the information kept in the ledger.

In the constrained synchronization problem we want to know if a given input automaton admits a synchronizing word contained in a (fixed) regular constraint language. Here we study the computational complexity of the constrained synchronization problem for the class of regular commutative constraint languages and the computational complexity of the problem restricted to commutative input semi-automata. We give a full classification of the computational complexity of the constrained synchronization problem for commutative regular constraints. Depending on the constraint language, our problem becomes PSPACE -complete, NP -complete or polynomial time solvable. In addition, we derive a polynomial time decision procedure for the complexity of the constrained synchronization problem, given a constraint automaton accepting a commutative language as input. Furthermore, for commutative input semi-automata, the problem is decidable in polynomial time, regardless of the regular constraint language. [ABSTRACT FROM AUTHOR]

The idea behind the neutrosophic set is we can connect the concept by dynamics of opposite interacts and its neutral that are uncertain and get common parts. Automata theory is beneficial to solve computational complexity problem and also it is an influential mathematical modeling tool in computer science. Inspired by the concepts of neutrosophic sets and automata theory, here, we are introducing and discussing the algebraic concept of neutrosophic finite automata based on the paper [10]. Generally, composite machines can be achieved by the output of the one machine that will be used as input for another machines. This paper introduced the concept of composite automata under the environment of the neutrosophic set and also examined the box function between the composite neutrosophic finite automata.

There are many cases in which our understanding of a system may be limited due to its complexity or lack of access into the entire system, leaving us with only partial system knowledge. This paper proposes a novel systematic active-learning method for realizing a partially-known Discrete Event System (DES). The proposed technique takes the available information about the system into account by tabularly capturing the known data from the system, and then, discovers the unknown part of the system via an active-learning procedure. For this purpose, a series of tables will be constructed to first infer the information about the system from the available data, and if unavailable, the developed algorithm collects the information through basic queries made to an oracle. It is proven that the developed technique returns a language-equivalent finite-state automaton model for the system under identification after a finite number of iterations. A real-world illustrative example is provided to explain the details of the proposed method.

This paper analyses simulation systems for teaching compilers, represents their technical characteristics and topics addressed, their benefits in the teaching process, and the advantages and disadvantages of each simulator analyzed. Based on this information, a reader can easily decide which simulator is the most suitable for his needs. The usage of simulators in education has been recognized as an effective tool for exploration of complex and dynamic systems. A simulator can illustrate a large number of abstract theoretical concepts from the various phases of program translation. Simulation systems in the field of compilers stand for a perfect combination of theory and practical experiences, and as such contribute to the improvement of the teaching process.

The linked governance set has presently been introduced as an attractive scheme to the region analysis in wireless sensor networks (WSNs). Therefore the key issue bothering the behavior of the prevailing Minimal sized Governing Set (MGS) based analysis standards is that they are focused on increasing the count of sleep nodes to safeguard the energy. It makes the lively sensors to feel immense loads for handling voluminous adjacencies. The quicker depletion of the lively sensors might detach the network standard and discards the region explored. Hence for offering an improved transmission of the network association analysis and lifespan, a precise count of sensors must be triggered. The intention is based on the angle restricted minimal load allowance of the MGS issues termed as Angle Restricted minimal load MGS (ARGS) to design the region analysis in WSNs. The precise decision of the angle restriction of ARGS equalizes the load within the network on the lively sensors enhances the network analysis and lifespan. The knowledge automation-based heuristics termed as Automata Theory-based Energy Efficient Area algorithm (ATEEA) is designed for locating a close optimal solution to the substitution identical ARGS issues in WSN. The analysis difficulties of the designed scheme to locate the optimal solution of the region analysis issue are estimated. Diverse experiments are performed to depict the supremacy of the designed analysis standards over the prevailing MGS-based schemes in terms of rate of coverage region, remaining energy, number of lively nodes and the lifetime of the networks. [ABSTRACT FROM AUTHOR]

Afflictions, or predispositions to have particular disorders in an animal are often caused by specific genes. However, some of these conditions could be avoided using genetic alterations during the breeding process. A good example is brachycephaly in dogs, which, in many cases, causes dyspnoea. In this research paper, we focused on using Finite Deterministic Automata for pattern recognition in dog genes in order to improve the breathing problems of French bulldogs, and other brachycephalic breeds. [ABSTRACT FROM AUTHOR]

Venkatachala on the one hand, and Avdispahić & Zejnulahi on the other, both studied integer sequences with an unusual sum property defined in a greedy way, and proved many results about them. However, their proofs were rather lengthy and required numerous cases. In this paper, I provide a different approach, via finite automata, that can prove the same results (and more) in a simple, unified way. Instead of case analysis, we use a decision procedure implemented in the free software Walnut. Using these ideas, we can prove a conjecture of Quet and find connections between Quet's sequence and the "married" functions of Hofstadter. • Uses a new technique, automata theory, to prove properties of some greedily-defined integer sequences. • Finds much simpler proofs of some known results in the literature. • Finds a new connection between Quet's sequence and the Hofstadter married functions. [ABSTRACT FROM AUTHOR]

The idea behind the neutrosophic set is we can connect the concept by dynamics of opposite interacts and its neutral that are uncertain and get common parts. Automata theory is beneficial to solve computational complexity problem and also it is an in uential mathematical modeling tool in computer science. Inspired by the concepts of neutrosophic sets and automata theory, here, we are introducing and discussing the algebraic concept of neutrosophic finite automata based on the paper [10]. Generally, composite machines can be achieved by the output of the one machine that will be used as input for another machines. This paper introduced the concept of composite automata under the environment of the neutrosophic set and also examined the box function between the composite neutrosophic finite automata. [ABSTRACT FROM AUTHOR]

In this paper, we study two important problems related to quasi-multiautomata: the complicated nature of verification of the GMAC condition for systems of quasi-multiautomata, and the fact that the nature of quasi-multiautomata has deviated from the original nature of automata as seen by the theory of formal languages. For the former problem, we include several new conditions that simplify the procedure. For the latter problem, we close this gap by presenting a construction of quasi-multiautomata, which corresponds to deterministic automata of the theory of formal languages and is based on the operation of concatenation.

We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 2 5 is the sum of at most three natural numbers whose base- 2 representation has an equal number of 0 's and 1 's. [ABSTRACT FROM AUTHOR]

The main contribution of this paper is oriented towards system modeling with resource conflicts, in which a set of tasks must be completed at the earliest. Mutual exclusion between tasks with underlying resource conflicts is modeled as subsystems through local tropical automata. Parallel task execution is explored through a new framework for a synchronous product of tropical automata directly minimizing the global completion time of a set of tasks. A dater-based analysis is proposed to determine an optimal qualitative schedule and relies on proposed definitions of global, private, and synchronizing daters. This approach drastically narrows the solution spectrum, and allows finding the optimal task schedule. The approach is applied to a flow network as a case study, but can be applied to systems of different nature. [ABSTRACT FROM AUTHOR]

We show how some problems in additive number theory can be attacked in a novel way, using techniques from the theory of finite automata. We start by recalling the relationship between first-order logic and finite automata, and use this relationship to solve several problems involving sums of numbers defined by their base-2 and Fibonacci representations. Next, we turn to harder results. Recently, Cilleruelo, Luca, & Baxter proved, for all bases b ≥ 5, that every natural number is the sum of at most 3 natural numbers whose base-b representation is a palindrome (Cilleruelo et al., Math. Comput. 87, 3023–3055, 2018). However, the cases b = 2, 3, 4 were left unresolved. We prove that every natural number is the sum of at most 4 natural numbers whose base-2 representation is a palindrome. Here the constant 4 is optimal. We obtain similar results for bases 3 and 4, thus completely resolving the problem of palindromes as an additive basis. We consider some other variations on this problem, and prove similar results. We argue that heavily case-based proofs are a good signal that a decision procedure may help to automate the proof. [ABSTRACT FROM AUTHOR]

We exhaustively investigate possible combinations of a Boolean operation together with a catenation. In many cases we prove and improve some conjectures by Brzozowski. For each family of operations, we endeavour to provide a common witness with a small size alphabet. [ABSTRACT FROM AUTHOR]

We develop a generic framework to extend the logics LTL, CTL+ and CTL⁎ by automata-based connectives from formal language classes and analyse this framework with regard to regular languages, visibly pushdown languages, deterministic and non-deterministic context-free languages. More precisely, we consider how the use of different automata classes changes the expressive power of the logics and provide algorithms for the satisfiability and model checking problems induced by the use of different classes of automata. For the model checking problem, we treat not only finite Kripke transition systems, but also visibly pushdown systems and pushdown systems. We provide completeness or undecidability results in all cases and show that the extensions we consider can formulate properties not expressible in classical temporal logics or regular extensions thereof. [ABSTRACT FROM AUTHOR]

Mutations on Brauer configurations are introduced and associated with some suitable automata to solve generalizations of the Chicken McNugget problem. Additionally, based on marked order polytopes, the new Diophantine equations called Gelfand–Tsetlin equations are also solved. The approach allows algebraic descriptions of some properties of the AES key schedule via some Brauer configuration algebras and suitable non-deterministic finite automata (NFA).

Solomon Marcus (1925–2016) was one of the founders of the Romanian theoretical computer science. His pioneering contributions to automata and formal language theories, mathematical linguistics and natural computing have been widely recognised internationally. In this paper we briefly present his publications in theoretical computer science and related areas, which consist in almost ninety papers. Finally we present a selection of ten Marcus books in these areas.

We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized. We show that the asymptotic complexity of the standard implementation is linearithmic and the incremental one is O(n3 log(n)) where n is the DFTA size.

Virtual power plant (VPP) is a hybrid power system with a mesh of distributed resources, local loads and storage with both discrete and continuous variables involved. Control of such system requires advanced control schemes to make distributed assets act together to mimic an actual power plant. Previously, to study the behaviour of such systems, complex algorithms and modelling tools have been used but this paper proposes the use of Hybrid Automata (HA) as a convenient tool to model these systems. To demonstrate this, HA is used to model a VPP for a research farm owned by Newcastle University as a first step to design the control for the system.

The main objective of our paper is to focus on the study of sequences (finite or countable) of groups and hypergroups of linear differential operators of decreasing orders. By using a suitable ordering or preordering of groups linear differential operators we construct hypercompositional structures of linear differential operators. Moreover, we construct actions of groups of differential operators on rings of polynomials of one real variable including diagrams of actions–considered as special automata. Finally, we obtain sequences of hypergroups and automata. The examples, we choose to explain our theoretical results with, fall within the theory of artificial neurons and infinite cyclic groups.

We developed a mobile app named Automata Simulator to simulate different types of automata and used it to teach the course on theory of computation. The students used the app to design and simulate automata during the lectures. The students also used a more sophisticated desktop application, JFLAP, to study advanced concepts related to automata theory after the lectures. An analysis of the examination results revealed that this approach helped the students to learn the concepts better and score 1% more marks. Moreover, a strong correlation between the marks obtained by the students for questions related to designing of automata and their total score was identified. In a survey conducted at the end of the semester, the students said that it was difficult to use two tools for learning the same concepts. However, they also felt that the combination of the two tools made the course more interactive and contributed positively in the process of learning. [ABSTRACT FROM AUTHOR]

Virtual power plant (VPP) is a hybrid power system with a mesh of distributed resources, local loads and storage with both discrete and continuous variables involved. Control of such system requires advanced control schemes to make distributed assets act together to mimic an actual power plant. Previously, to study the behaviour of such systems, complex algorithms and modelling tools have been used but this paper proposes the use of Hybrid Automata (HA) as a convenient tool to model these systems. To demonstrate this, HA is used to model a VPP for a research farm owned by Newcastle University as a first step to design the control for the system. [ABSTRACT FROM AUTHOR]

We define a notion of randomness for individual and collections of formal languages based on automatic martingales acting on sequences of words from some underlying domain. An automatic martingale bets if the incoming word belongs to the target language or not. Then randomness of both single languages and collections of languages is defined as a failure of automatic martingale to gain an unbounded capital by betting on the target language according to an incoming sequence of words, or a text. The randomness of formal languages turned out to be heavily dependent on the text. For very general classes of texts, any nonregular language happens to be random when considered individually. As for collections of languages, very general classes of texts permits nonrandomness of automatic families of languages only. On the other hand, an arbitrary computable language is shown to be nonrandom under certain dynamic texts. [ABSTRACT FROM AUTHOR]

This paper presents a connection between fuzzy sets, biological inheritance and hyperstructures in which we consider the set of phenotypes of the second generation F2 in different types of inheritance, define fuzzy subsets of it and construct a sequence of join spaces associated to each of its types. [ABSTRACT FROM AUTHOR]

The event‐triggered hybrid control is proposed in this study to realise multi‐model switching when the microgrid system is operating in the island mode. The hybrid control includes decentralised control strategy and coordinated control strategy. Firstly, control commands in the hybrid control strategy are triggered by the event triggering mechanism including trigger events and trigger conditions. When a trigger condition is met, the corresponding event is triggered to execute the corresponding control command. Secondly, the microgrid system is divided into an upper control layer and a lower execution layer by using the multi‐agent system theory. For the upper control layer, a coordinated control strategy based on decision tree algorithm is designed, which can not only issue switching control commands to the lower execution layer, but also reduce the number of switching, improve system stability, and enrich the control strategy. For the lower execution layer, a decentralised control strategy is designed to realise distributed operation of the underlying units. Finally, the model of hybrid automata of each unit is established to ensure the smooth switching of working modes of each unit. The simulation results verify the effectiveness of the event‐triggered hybrid control strategy for controlling the microgrid. [ABSTRACT FROM AUTHOR]

• Nucleotide sequences capable to form combinations of DNA non-canonical structures were detected. • Special software for molecular biologist was developed. • Minimal length of nucleotide sequences with structural polymorphism was revealed. In this study, we develop a program that allows us to reveal DNA receptors, i.e. nucleotide sequences that may form more than one non-canonical structure. The data obtained may be analysed either experimentally or using DNA banks, and refers to the coding, non-coding or promotor region of the gene. These results provide a better understanding of the role that non-canonical structures play in pathological modifications of the genetic apparatus, resulting in tumour formation or inherited disease. They also reveal the effect of single nucleotide polymorphisms on gene expression, indicate so-called "risk regions" in which the substitution of a single nucleotide may lead to increased formation of non-canonical structures, and elucidate the epigenetic mechanisms of microorganism adaptation. [ABSTRACT FROM AUTHOR]

Several fixed-point models share the equational properties of iteration theories, or iteration categories, which are cartesian categories equipped with a fixed point or dagger operation subject to certain axioms. After discussing some of the basic models, we provide equational bases for iteration categories and offer an analysis of the axioms. Although iteration categories have no finite base for their identities, there exist finitely based implicational theories that capture their equational theory. We exhibit several such systems. Then we enrich iteration categories with an additive structure and exhibit interesting cases where the interaction between the iteration category structure and the additive structure can be captured by a finite number of identities. This includes the iteration category of monotonic or continuous functions over complete lattices equipped with the least fixed-point operation and the binary supremum operation as addition, the categories of simulation, bisimulation, or language equivalence classes of processes, context-free languages, and others. Finally, we exhibit a finite equational system involving residuals, which is sound and complete for monotonic or continuous functions over complete lattices in the sense that it proves all of their identities involving the operations and constants of cartesian categories, the least fixed-point operation and binary supremum, but not involving residuals. [ABSTRACT FROM AUTHOR]

Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and to additional operational costs. However, some routers are able to encapsulate, decapsulate, and convert protocols, and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and to automate the routing configurations. Software-defined networking-based architectures offer an opportunity to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem, as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases. If there is no bandwidth constraint, we propose a polynomial algorithm that computes the optimal path. We also give lower and upper bounds on the optimal path length. On the other hand, we show that the problem is $\mathsf {NP}$ -hard if there is a bandwidth constraint (or other quality-of-service parameters), even if there is only two protocols and in a symmetric graph. We study the complexity and the scalability of our algorithms and evaluate their performances on real and random topologies. The results show that they are faster than the previous ones proposed in the literature. These algorithms can also have important applications in automatic tunneling. [ABSTRACT FROM AUTHOR]

Abstract In this paper, we study the lattice and the Boolean algebra, possibly closed under quotient, generated by the languages of the form u ⁎ , where u is a word. We provide effective equational characterisations of these classes, i.e. one can decide using our descriptions whether a given regular language belongs or not to each of them. [ABSTRACT FROM AUTHOR]

Models of consciousness are usually developed within physical monist or dualistic frameworks, in which the structure and dynamics of the mind are derived from the workings of the physical brain. Little attention has been given to modelling consciousness within a mental monist framework, deriving the structure and dynamics of the mental world from primitive mental constituents only—with no neural substrate. Mental monism is gaining attention as a candidate solution to Chalmers’ Hard Problem on philosophical grounds, and it is therefore timely to examine possible formal models of consciousness within it. Here, I argue that the austere ontology of mental monism places certain constraints on possible models of consciousness, and propose a minimal set of hypotheses that a model of consciousness (within mental monism) should respect. From those hypotheses, it would be possible to construct many formal models that permit universal computation in the mental world, through cellular automata. We need further hypotheses to define transition rules for particular models, and I propose a transition rule with the unusual property of deep copying in the time dimension.

In this paper, which is based on a real-life motivation, we present an algebraic theory of automata and multi-automata. We combine these (multi-)automata using the products introduced by W. Dörfler, where we work with the cartesian composition and we define the internal links among multiautomata by means of the internal links’ matrix. We used the obtained product of n-ary multi-automata as a system that models and controls certain traffic situations (lane shifting) for autonomous vehicles.