Composition Of Automata Research Articles

Simple chain automaton random number generator for IoT devices

Random numbers are very important in many fields of computer science. Generating high-quality random numbers using only basic arithmetic operations is challenging, especially for devices with limited hardware capabilities, such as Internet of Things (IoT) devices. In this paper, we present a novel pseudorandom number generator, the simple chain automaton random number generator (SCARNG), based on compositions of abstract automata. The main advantage of the presented algorithm is its simple structure that can be implemented easily for very low computing capacity IoT systems, FPGAs or GPU hardware. The generated random numbers demonstrate promising statistical behavior and satisfy the NIST statistical suite requirements, highlighting the potential of the SCARNG for practical applications.

A PSEUDORANDOM NUMBER GENERATOR WITH FULL CYCLE LENGTH BASED ON AUTOMATA COMPOSITIONS

In this paper a new Pseudorandom Number Generator based on compositions of abstract automata is presented. We show that it has full cycle with length of 2^128. It is also shown that the output satisfies the statistical requirements of the NIST randomness test suite.

N-ary Cartesian composition of automata

In our paper, we construct Cartesian composition of automata in a way rather different from the classical approach. In our case, the resulting structure is not an automaton but a quasi-multiautomaton, i.e., a structure whose input alphabet is a semihypergroup instead of a set or a free monoid. In our reasoning, we make use of earlier results on complete (semi)hypergroups and show that this approach not only simplifies our construction but also yields some natural applications.

A Probabilistic Model for the Interaction of an Agent with a Network Environment

This paper elaborates and analyzes a general discrete non-stationary probabilistic model for the interaction of an agent with a counteracting layered network environment. The proposed model is represented as a composition of two probabilistic finite automata with a variable structure. This composition of automata is a two-person game in which the player that makes a move inflicts damage on the opponent.

A novel cryptosystem based on abstract automata and Latin cubes

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

A finite state intersection approach to propositional satisfiability

We use a finite state (FSA) construction approach to address the problem of propositional satisfiability (SAT). We present a very simple translation from formulas in conjunctive normal form (CNF) to regular expressions and use regular expressions to construct an FSA. As a consequence of the FSA construction, we obtain an ALL-SAT solver and model counter. This automata construction can be considered essentially a finite state intersection grammar (FSIG). We also show how an FSIG approach can be encoded. Several variable ordering (state ordering) heuristics are compared in terms of the running time of the FSA and FSIG construction. We also present a strategy for clause ordering (automata composition). Running times of state-of-the-art model counters and BDD based SAT solvers are compared and we show that both the FSA and FSIG approaches obtain an state-of-the-art performance on some hard unsatisfiable benchmarks. It is also shown that clause learning techniques can help improve performance. This work brings up many questions on the possible use of automata and grammar models to address SAT.

Global automata: a new approach on modelling industrial systems

This paper introduces Global Automata as a new approach on modelling contemporary industrial systems. Global automata are based on automata philosophy and, as their name reveals, they constitute a super-set of existing automata types. Their implementation field is, therefore, wider in comparison with other available types. Their main characteristic is that they are especially oriented for industrial use. As regards to model architecture, they introduce new formulation parameters diversifying from conventional types, while they keep some common basic features. A formal definition of global automata is given as also two useful tools for system modelling, which are state aggregation and automata composition. Their use is illustrated with two representative industrial examples.

Merging partial system behaviours: composition of use-case automata

Modelling the behaviour of a system under development has proved to be a very effective way to ensure that it will be constructed correctly. However, building up this model is a difficult task that requires a significant time investment and a high level of expertise. Consequently, incremental approaches that construct a system model from partial behavioural descriptions have been widely adopted. The challenge in such approaches lies in finding both the adequate behavioural formalism that fits the needs of the analyst and a formal composition mechanism that facilitates the generation of the expected behavioural model and produces a verifiable model. Within this framework, use-case approaches have been also accepted in industry because they make the process of requirements elicitation simpler. Their main shortcoming is their lack of formalisation, which makes validation difficult. A formal approach for composing partial system behaviours where partial system behaviours are defined as finite state automata is proposed. Each automaton represents a use-case that describes a certain system concern, hence the name use-case automaton (UCA). The composition of different UCAs could be performed with respect to a set of states or transitions specified by the analyst, using certain composition operators. Each of these operators has a precise semantics, which is defined by how the composition is performed. The formalization of use-case composition is based on label matching between the UCAs to be composed. Our approach is fully automated and provides the advantage of generating a UCA that meets the intended behaviour without unexpected scenarios. Finally, the UMACT, which implements our composition approach, is presented.

On special properties of a composition of automata

We suggest algorithms for constructing models of a finite automaton which are new automata such that the equations describing the functioning of these models are consequences of the equations describing the functioning of the initial automaton. These new automata are constructed with the use of powers of the initial automaton and some additional functions on the output words. Applications of the results are related to the problem on determining the state of an automaton on the base of the input sequences and the corresponding output sequences.

On special properties of a composition of automata

We suggest algorithms for constructing models of a finite automaton which are new automata such that the equations describing the functioning of these models are consequences of the equations describing the functioning of the initial automaton. These new automata are constructed with the use of powers of the initial automaton and some additional functions on the output words. Applications of the results are related to the problem on determining the state of an automaton on the base of the input sequences and the corresponding output sequences.

On quasi-homomorphisms and compositions of automata

On quasi-homomorphisms and compositions of automata

The cartesian composition of automata

There are several known ways to define a product automaton on the cartesian product of the state sets of two given automata. This paper introduces a new product called the cartesian composition and discusses how various properties of the product automaton depend on the corresponding properties of the factors. A main result is that any finite connected automaton has a unique representation as a cartesian composition of prime automata.

Optimization of discrete transformers with respect to speed of composition of automata

Optimization of discrete transformers with respect to speed of composition of automata

THE ABSTRACT THEORY OF AUTOMATA

CONTENTS Introduction § 1. Homomorphism and equivalence of automata § 2. Introduction of mappings in automata § 3. Introduction of events in finite automata, operations on events § 4. Automata and semi-groups § 5. The composition of automata § 6. Experiments with automata Conclusion References