Finite Automata Theory Research Articles

Development of an automaton recognizer of tissue pathologies caused by Chlamydia infection

Chlamydia belongs to such diseases, in which the blood-brain barrier permeability is disturbed leading to degenerative changes of brain cells and development of neurological symptoms in animals. Chlamydiae disrupt the barrier function of endothelium, which inside blood vessels forms a semipermeable barrier between the contents of vessels and surrounding tissues. As a result of this process, part of the endothelial cytes slough into the lumen of blood vessels and destroying, contributes to the generalization of infection in the body. Chlamydia infection affecting mammals and birds is caused by antigenically related microorganisms from the Chlamydiacea family. Under animal chlamydia a whole range of diseases is considered, which, due to their polymorphic nature, cannot be united by a specific symptom complex, and sometimes affect all systems and organs. Due to the lack of organotropism and host specificity in different representatives of chlamydiae, the clinic of chlamydiae is extremely diverse. As a diagnosis of this disease, as well as the accuracy of the results, the histological method of examination of pathological material is used. In the process of the conducted research qualitative and quantitative characteristics of pathomorphological changes of cellular structures were determined, with the identification of indicators. All pathological processes occurring in the cell of the organism we have divided into three main groups: cell membrane pathology, cell membrane pathology, and Mitochondria pathology. We developed a decision support module for preliminary diagnosis of pathologies. A truth table of the relationship between indicators and pathology groups was developed. Minimization of disjunctive normal form was carried out using finite automata theory.

Development of a Prototype of an Automated Dog Feeding System

In large kennels, canine services have difficulties in feeding dogs. Known dog feeding systems are studied and the development of an automated system using Omron PLC is described. The developed technological scheme is given. For simplification of installation, the equipment is divided into modules. A table of signal addresses used in Omron series industrial controllers is given. The system of logical equations for controlling the main modules of the equipment device drive is given. Purpose of the research: development of the project of the automated system of dog feeding in kennels. Materials and methods: the theory of finite automata, the theory of synthesis of logical equations and ladder diagram technique were used. The software was developed using Software CX’, ’One. Results: a laboratory bench prototype of the automated feeding system was developed. Practical significance: implementation of this system in departmental organizations will reduce the time spent on food dosing, reduce the probability of error associated with the human factor, as well as provide the process of feeding dogs while reducing the labor input of service personnel.

Development of Reliable and Effective Methods of Cryptographic Protection of Information Based on the Finite Automata Theory

Development of Reliable and Effective Methods of Cryptographic Protection of Information Based on the Finite Automata Theory

Structural peculiarities of tandem repeats and their clinical significance

While it is well established that a mere 2% of human DNA nucleotides are involved in protein coding, the remainder of the DNA plays a vital role in the preservation of normal cellular genetic function. A significant proportion of tandem repeats (TRs) are present in non-coding DNA. TRs - specific sequences of nucleotides that entail numerous repetitions of a given fragment.In this study, we employed our novel algorithm grounded in finite automata theory, which we refer to as Dafna, to investigate for the first time the likelihood of these nucleotide sequences forming non-canonical DNA structures (NS). Such structures include G-quadruplexes, i-motifs, hairpins, and triplexes. The tandem repeats under consideration in our research encompassed sequences containing 1 to 6 nucleotides per repeated fragment.For comparison, we employed a set of randomly generated sequences of the same length (60 nucleotides) as a benchmark. The outcomes of our research exposed a disparity between the potential for NS formation in random sequences and tandem repeats.Our findings affirm that the propensity of DNA and RNA to form NS is closely tied to various genetic disorders, including Huntington's disease, Fragile X syndrome, and Friedreich's ataxia. In the concluding discussion, we present a proposal for a new therapeutic mechanism to address these diseases. This novel approach revolves around the ability of specific nucleic acid fragments to form multiple types of NS.

Ramsey monoids

Recently, Solecki [Forum Math. Sigma 7 (2019), p. 40] introduced the notion of Ramsey monoid to produce a common generalization to theorems such as Hindman’s theorem, Carlson’s theorem, and Gowers’ F I N k FIN_k theorem. He proved that an entire class of finite monoids is Ramsey. Here we improve this result, enlarging this class and finding a simple algebraic characterization of finite Ramsey monoids. We extend in a similar way a result of Solecki regarding a second class of monoids connected to the Furstenberg-Katznelson Ramsey theorem. The results obtained suggest a possible connection with Schützenberger’s theorem and finite automata theory.

Second-Order Finite Automata

Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata with ordered decision diagrams, with the aim of representing possibly infinite sets of sets of strings. Our main result states that second-order finite automata can be canonized with respect to the second-order languages they represent. Using this canonization result, we show that sets of sets of strings represented by second-order finite automata are closed under the usual Boolean operations, such as union, intersection, difference and even under a suitable notion of complementation. Additionally, emptiness of intersection and inclusion are decidable. We provide two algorithmic applications for second-order automata. First, we show that several width/size minimization problems for deterministic and nondeterministic ODDs are solvable in fixed-parameter tractable time when parameterized by the width of the input ODD. In particular, our results imply FPT algorithms for corresponding width/size minimization problems for ordered binary decision diagrams (OBDDs) with a fixed variable ordering. Previously, only algorithms that take exponential time in the size of the input OBDD were known for width minimization, even for OBDDs of constant width. Second, we show that for each k and w one can count the number of distinct functions computable by ODDs of width at most w and length k in time h(|Σ|,w) ⋅ kO(1), for a suitable h:mathbb {N}times mathbb {N}rightarrow mathbb {N}. This improves exponentially on the time necessary to explicitly enumerate all such functions, which is exponential in both the width parameter w and in the length k of the ODDs.

Synchronizing words and monoid factorization, yielding a new parameterized complexity class?

AbstractThe concept of a synchronizing word is a very important notion in the theory of finite automata. We consider the associated decision problem to decide if a given DFA possesses a synchronizing word of length at most k, where k is the standard parameter. We show that this problem DFA-SW is equivalent to the problem Monoid Factorization introduced by Cai, Chen, Downey, and Fellows. Apart from the known $\textsf{W}[2]$ -hardness results, we show that these problems belong to $\textsf{A}[2]$ , $\textsf{W}[\textsf{P}],$ and $\textsf{WNL}$ . This indicates that DFA-SW is not complete for any of these classes, and hence, we suggest a new parameterized complexity class $\textsf{W}[\textsf{Sync}]$ as a proper home for these (and more) problems. We present quite a number of problems that belong to $\textsf{W}[\textsf{Sync}]$ or are hard or complete for this new class.

Hidden Hypergraphs, Error-Correcting Codes, and Critical Learning in Hopfield Networks.

In 1943, McCulloch and Pitts introduced a discrete recurrent neural network as a model for computation in brains. The work inspired breakthroughs such as the first computer design and the theory of finite automata. We focus on learning in Hopfield networks, a special case with symmetric weights and fixed-point attractor dynamics. Specifically, we explore minimum energy flow (MEF) as a scalable convex objective for determining network parameters. We catalog various properties of MEF, such as biological plausibility, and then compare to classical approaches in the theory of learning. Trained Hopfield networks can perform unsupervised clustering and define novel error-correcting coding schemes. They also efficiently find hidden structures (cliques) in graph theory. We extend this known connection from graphs to hypergraphs and discover n-node networks with robust storage of memories for any . In the case of graphs, we also determine a critical ratio of training samples at which networks generalize completely.

An intelligent and lightweight intrusion detection mechanism for RPL routing attacks by applying automata model

ABSTRACT Routing Protocol for Low power and Lossy network (RPL) offers a set of mechanisms to attain efficient communication over resource-limited heterogeneous IoT environments. RPL attacks downgrade the network performance by disrupting the optimal protocol structure. So it is crucial to develop lightweight security solutions to detect such attacks and maximize the RPL performance. This paper designs an intelligent and lightweight IDS model named RPL Attacks based on Intrusion Detection for Efficient Routing (RAIDER) to reinforce security of RPL routing mechanism. RAIDER addresses the lack of security over RPL by analyzing the impacts of four RPL attacks using simulation, incorporates an automata theory with the IDS nodes to scrutinize the node behavior and to diminish the impact of such attacks. The IDS nodes monitor the network and periodically transplant the observed information as different states based on the finite automata theory. RAIDAR takes attack decisions based on the state transitions pre-estimated threshold of context-aware attack decision-making model and detects RPL attacks. RAIDER improves the RPL routing performance with minimum energy consumption. The Contiki Cooja-based simulation results demonstrate the efficiency of the RAIDER in terms of the packet delivery ratio, energy consumption, delay, overhead, attack detection accuracy, and network lifetime.

A novel cryptosystem based on DNA cryptography and randomly generated mealy machine

Nowadays, the amount of data produced and stored in computing devices is increasing at an alarming rate. Tremendous amounts of critical and sensitive data are transmitted between all these devices. Thus, it is very imperative to guarantee the security of all these indispensable data. Cryptography is a commonly used technique to ensure data security. The fundamental objective of cryptography is to transmit data from the sender to the receiver in the most secure way, so that an attacker is unable to extract the original data content. This paper proposes a novel cryptosystem based on Deoxyribonucleic Acid (DNA) cryptography and finite automata theory. The system is made of three entities, namely a key pair generator, a sender and a receiver. The sender generates a 256-bit DNA based secret key based on the attributes of the receiver, and this key is used for data encryption. Then, a randomly generated Mealy machine is used for coding the DNA sequence, which makes the ciphertext more secure. The proposed scheme can protect the system against numerous security attacks, such as brute force attack, known plaintext attack, differential cryptanalysis attack, cipher text only attack, man-in-the-middle attack and phishing attack. The results and discussions show that the proposed scheme is efficient and secure than the existing schemes.

Optimized dual path analysis using finite automata theory in wireless sensor networks

Optimized dual path analysis using finite automata theory in wireless sensor networks

Building a model for recognition of morphostructure pathologies in animal tissues

Microscopic images of histological analysis have a complex flat structure. The result of the analysis and interpretation of the diagnosis strongly depends on the qualification of the veterinarian; therefore, the development of methods and models for automated histological diagnosis of diseases is an urgent task. The article considers the known approaches for building expert systems of histological diagnostics. Expert systems of histological analysis can be used in clinical veterinary medicine for advanced training of veterinary pathologists. The possibility of using the theory of finite automata for construction of the device - histological analyzer is shown. As an example of histological analysis the task of recognition of images of morphofunctional changes in rodent tissues on the example of the soft brain of a rat damaged by chlamydia infection is considered. Pathological indicators of morphostructural changes in tissues in case of chlamydia infection have been revealed and explained: erythrocyte slide with clot formation, nucleihyperchrome, tissue edema, hemorrhage and desquamation of endotheliocytes. For image recognition it is suggested to use computer neural network technologies based on multilayer perceptron. The number of synoptic scales for perceptron design has been calculated. Examples are given and construction of training sets on the basis of which the table of truth for neural network training constructed is shown. Computer experiments have shown the possibility of using neural network technologies for recognition of pathology indicators during histological analysis of morphostructural changes in animal tissues.

Dialogue System of Controlling Robot Based on the Theory of Finite-State Automata

The article discusses the system of dialogue control manipulation robots. The analysis of the basic methods of automatic speech recognition, speech understanding, dialogue management, voice response synthesis in dialogue systems has been carried out. Three types of dialogue management are considered as "system initiative", "user initiative" and "combined initiative". A system of object-oriented dialog control of a robot based on the theory of finite state machines with using a deep neural network is proposed. The main difference of the proposed system lies in the separate implementation of the dialogue process and robot’s actions, which is close to the pace of natural dialogue control. This method of constructing a dialogue control robot allows system to automatically correct the result of speech recognition, robot’s actions based on tasks. The necessity of correcting the result of speech recognition and robot’s actions may be caused by the users’ accent, working environment noise or incorrect voice commands. The process of correcting speech recognition results and robot’s actions consists of three stages, respectively, in a special mode and a general mode. The special mode allows users to directly control the manipulator by voice commands. The general mode extends the capabilities of users, allowing them to get additional information in real time. At the first stage, continuous speech recognition is built by using a deep neural network, taking into account the accents and speech speeds of various users. Continuous speech recognition is a real-time voice to text conversion. At the second stage, the correction of the speech recognition result by managing the dialogue based on the theory of finite automata. At the third stage, the actions of the robot are corrected depending on the operating state of the robot and the dialogue management process. In order to realize a natural dialogue between users and robots, the problem is solved in creating a small database of possible dialogues and using various training data. In the experiments, the dialogue system is used to control the KUKA manipulator (KRC4 control) to put the desired block in the specified location, implemented in the Python environment using the RoboDK software. The processes and results of experiments confirming the operability of the interactive robot control system are given. A fairly high accuracy (92 %) and an automatic speech recognition rate close to the rate of natural speech were obtained.

Workover Simulating Based on the Theory of Automata

In order to solve the problem that workover simulator cannot respond any operation, a design scheme of workover simulator based on automata theory is proposed. This paper analyzes the current problems existing in the workover simulator, and puts forward the necessity and feasibility of solving the problem. Taking running tubing as an example, this paper analyzes the steps in the operation procedure, and designs the relation between the status and actions, using the theory of finite automata to achieve arbitrary operation response during workover simulation. The result shows the flexibility and stability of the system.

MAJORITY NANO-DEVICES OF SEQUENTIAL TYPE

The paper describes the computer-aided design of reliable sequential nanoscale devices with majority structures. When constructing majority nanocircuits on the basis of technology of cellular quantum automates, the theory of finite automata is used. Basic principles of construction and peculiarities of trigger nanoelements functioning are considered. The developed mathematical models of high-speed one-electron nanocounters of addition and subtraction. Quantum cellular automata logic designers and circuits require a fast and accurate modeling and design tool to determine the functionality of quantum cellular automata circuits. The QCADesigner (software) gives the designer the ability to quickly develop and create quantum cellular automata by providing a wide range of computer-aided design tools. In addition, several simulation engines facilitate quick and accurate modeling. Sequential nanoscale devices were created using the QCADesigner.

Additive Number Theory via Automata Theory

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.

Temporal analysis of a control system in a data processing network

Introduction:A control system for a data processing network interacts with the network by sending commands and receiving responses. Such a control system is responsible for the network viability, and therefore should be analyzed, in particular, in terms of behavior over time, without exhaustive search for possible control options.Purpose:Studying and analyzing the behavior of a control system in a data processing network using mathematical modeling based on finite automata theory, and performing computer simulation of the obtained theoretical positions.Results:A finite state machine is constructed, presented in the form of a transition graph, reflecting the temporal behavior of a part of a specific control system in the data processing network by Plug-and-Play manager. Rules of conduct are specified, and the problem of the manager FSM analysis is defined. As a result, the control vector types have been obtained which lead the PnP manager to the correct temporal behavior. Computer simulation was performed using a script program in MatLab mathematical package. The simulation results are presented as time diagrams of finite state machine transitions. Its behavior varies depending on the incoming signals and the starting state of the machine. On the time diagrams, you can trace the behavior and transitions between states, estimate the frequency of getting into a particular state, or bypass the machine states.Practical relevance:The control vector types found for the PnP manager without an exhaustive search do not lead to incorrect situations in network data processing.

Pattern analysis and texture classification using finite state automata scheme

The paper proposes a complete modelling of finite state automata along with the associated classifier for texture classification. Pattern analysis of the texture image is performed by proposing a symbolic pattern-based algorithm. This algorithm is developed based on the symbolic dynamics and finite state automata theory for estimating the state transition of the texture variations. Texture image is divided into several partitions, i.e., texture, background of the texture, shadow of the texture, etc. Finite automata state transitions are used to extract the features from the symbolised image. A binary classifier is designed to classify the texture categories based on the feature extraction from the finite automata theory. Pattern analysis is performed on the KITH-TIPS dataset for ten varied categories of texture. 99.12% classification accuracy is achieved when compared with other state-of-art techniques. The experimental study shows the better efficiency of the proposed system when compared to other existing methods.

Development of Power Consumption Models for ESP8266-Enabled Low-Cost IoT Monitoring Nodes

The development of energy and cost efficient IoT nodes is very important for the successful deployment of IoT solutions across various application domains. This paper presents energy models, which will enable the estimation of battery life, for both time-based and event-based low-cost IoT monitoring nodes. These nodes are based on the low-cost ESP8266 (ESP) modules which integrate both transceiver and microcontroller on a single small-size chip and only cost about $2. The active/sleep energy saving approach was used in the design of the IoT monitoring nodes because the power consumption of ESP modules is relatively high and often impacts negatively on the cost of operating the nodes. A low energy application layer protocol, that is, Message Queue Telemetry Transport (MQTT) was also employed for energy efficient wireless data transport. The finite automata theory was used to model the various states and behavior of the ESP modules used in IoT monitoring applications. The applicability of the models presented was tested in real life application scenarios and results are presented. In a temperature and humidity monitoring node, for example, the model shows a significant reduction in average current consumption from 70.89 mA to 0.58 mA for sleep durations of 0 and 30 minutes, respectively. The battery life of batteries rated in mAh can therefore be easily calculated from the current consumption figures.

Application of Diagrams of Deterministic Finite Automata for a Formal Description of Operating Modes of Electrical Apparatuses

This article suggests ways to describe the behavior and interaction of electrical apparatuses. Using the example of a modern modular circuit breaker, the possibility and necessity of the use of formal description of electrical-apparatus operation modes by means of deterministic finite automata is shown. The article demonstrates the solution the problem of the functional identification of this apparatus along with the impossibility of verifying the technical solutions for the interacting apparatus complexes without an available formal description of all devices that are parts of the system. It is shown that the application of the theory of deterministic finite automata for the formal presentation of electrical apparatuses as a mathematical object allows one to proceed to the simulation modeling of operation of both individual devices and a complex of interacting apparatuses.