An Automata Based Text Analysis System

This report describes and implements an automata based text analysis system. We have collected some of the writing samples. Each sample establishes a tree, and uses the ALERGIA algorithm to merge all compatible nodes in order to get a merged stochastic finite automaton. We store these automatons which demonstrate writing style of the sample texts in the hard drive. For a new testing piece, we can test if it has similar writing style compared to those sample texts

Investigación de un modelo de sistema no determinista multiproceso

Managing the systems which behaviour is non-deterministic is one of the most important problems in modern management theory. Today, systems with structural and behavioural complexity are prevalent in all areas of human activity, and therefore, their research is of the utmost importance. Such systems, as opposed to deterministic systems, are called non-deterministic. They are characterised by difficult predictable behaviour determined both by external random influences, and within the systems themselves. A clear example of a non-deterministic system is crowds of people, factories, and computer networks and systems. The problem of non-deterministic behaviour directly within the context of professional activities can be seen using an example of building syntactic analysers. The aim of the paper is to design a class of systems oriented towards supporting elements of a discrete event model. The target of research is to simulate discrete event models. The subject of research is a creation of a discrete event model based on the behaviour of an undetermined finite state automaton. During the preparation of the paper, there was developed and practically implemented an algorithm for the application, which materializes the principle of working with threads. The results obtained in the paper are aimed at solving the problem of parallel data processing based on the parallelism of NFA's (non-deterministic finite automaton) behaviour when reading the input string characters. As a result, this should have a positive impact on the regulation of the simulation processes of a non-deterministic system, increasing its efficiency and stability. In conclusion, the algorithm of the application work is disclosed and conclusions about the effectiveness and efficiency of its development are drawn.La gestión de sistemas cuyo comportamiento no es determinista es uno de los problemas más importantes de la teoría de la gestión moderna. Hoy en día, los sistemas con complejidad estructural y de comportamiento prevalecen en todas las áreas de la actividad humana y, por lo tanto, su investigación es de suma importancia. Tales sistemas, a diferencia de los sistemas deterministas, se denominan no deterministas. Se caracterizan por un comportamiento difícil de predecir, determinado tanto por influencias aleatorias externas como dentro de los propios sistemas. Un claro ejemplo de un sistema no determinista son las multitudes de personas, fábricas y redes y sistemas informáticos. El problema del comportamiento no determinista directamente en el contexto de las actividades profesionales puede verse utilizando un ejemplo de construcción de analizadores sintácticos. El objetivo del artículo es diseñar una clase de sistemas orientados a elementos de soporte de un modelo de eventos discretos. El objetivo de la investigación es simular modelos de eventos discretos. El tema de investigación es la creación de un modelo de evento discreto basado en el comportamiento de un autómata de estado finito indeterminado. Durante la preparación del trabajo, se desarrolló e implementó prácticamente un algoritmo para la aplicación, que materializa el principio de trabajar con hilos. Los resultados obtenidos en el artículo tienen como objetivo resolver el problema del procesamiento de datos en paralelo basado en el paralelismo del comportamiento de NFA (autómata finito no determinista) al leer los caracteres de la cadena de entrada. Como resultado, esto debería tener un impacto positivo en la regulación de los procesos de simulación de un sistema no determinista, aumentando su eficiencia y estabilidad. En conclusión, se divulga el algoritmo del trabajo de la aplicación y se extraen conclusiones sobre la efectividad y eficiencia de su desarrollo

Investigación de un modelo de sistema no determinista multiproceso

La gestión de sistemas cuyo comportamiento no es determinista es uno de los problemas más importantes de la teoría de la gestión moderna. Hoy en día, los sistemas con complejidad estructural y de comportamiento prevalecen en todas las áreas de la actividad humana y, por lo tanto, su investigación es de suma importancia. Tales sistemas, a diferencia de los sistemas deterministas, se denominan no deterministas. Se caracterizan por un comportamiento difícil de predecir, determinado tanto por influencias aleatorias externas como dentro de los propios sistemas. Un claro ejemplo de un sistema no determinista son las multitudes de personas, fábricas y redes y sistemas informáticos. El problema del comportamiento no determinista directamente en el contexto de las actividades profesionales puede verse utilizando un ejemplo de construcción de analizadores sintácticos. El objetivo del artículo es diseñaruna clase de sistemas orientados a elementos de soporte de un modelo de eventos discretos. El objetivo de la investigación es simular modelos de eventos discretos. El tema de investigación es la creación de un modelo de evento discreto basado en el comportamiento de un autómata de estado finito indeterminado. Durante la preparación del trabajo, se desarrolló e implementó prácticamente un algoritmo para la aplicación, que materializa el principio de trabajar con hilos. Los resultados obtenidos en el artículo tienen como objetivo resolver el problema del procesamiento de datos en paralelo basado en el paralelismo del comportamiento de NFA (autómata finito no determinista) al leer los caracteres de la cadena de entrada. Como resultado, esto debería tener un impacto positivo en la regulación de los procesos de simulación de un sistema no determinista, aumentando su eficiencia y estabilidad. En conclusión, se divulga el algoritmo del trabajo de la aplicación y se extraen conclusiones sobre la efectividad y eficiencia de su desarroll

Analysis on ALERGIA Algorithm: Pattern Recognition by Automata Theory

Based on Kolmogorov Complexity, a finite set x of strings has a pattern if the set x can be output by a Turing machine of length that is less than minimum of all |x|; this Turing machine, that may not be unique, is called a pattern of the finite set of string. In order to find a pattern of a given finite set of strings (assuming such a pattern exists), the ALERGIA algorithm is used to approximate such a pattern (Turing machine) in terms of finite automata. Note that each finite automaton defines a partition on formal language Σ*, ALERGIA algorithm can be viewed as Granular Rough Computing based approximations. Any subset of Σ*, such as DNA, can be approximated by equivalence classes. Based on this view, this thesis analyzes and improves the ALERGIA algorithm via minimization of deterministic finite automaton. Hypothesis testing indicates that the minimization does improve the ALERGIA. So the new method will have high usability in pattern recognition/data mining

Verification of temporal properties of infinite state systems

No es ningún secreto que tanto los sistemas software como hardware generalmente presentan errores. Los métodos de testeo y simulación pueden identificar muchos problemas importantes, pero para sistemas que tienen requerimientos de seguridad o que son económicamente críticos, es indispensable llevar a cabo una verificación exhaustiva. Tal análisis se puede realizar utilizando métodos de verificación formal. Un enfoque de la verificación formal es la verificación de modelos, que es un proceso totalmente automático basado en la construcción de modelos abstractos para representar sistemas. Poste- riormente, sobre estos modelos se comprueban propiedades deseadas del sistema, normalmente expresadas en alguna lógica temporal, como por ejemplo lógica linear temporal. Las propiedades expresadas con fórmulas de lógica linear temporal pueden describir el orden de los eventos en el tiempo sin describir el tiempo explícitamente. Por eso mismo, son útiles a la hora de verificar las posibles ejecuciones de un sistema. Este proyecto pretende implementar algoritmos de verificación de modelos que determinen si una fórmula de lógica linear temporal que exprese una propiedad de un cierto sistema es satisfecha por éste.It is no secret that computer software programs, computer hardware designs, and computer sys- tems in general exhibit errors. Testing and simulation methods can identify many significant problems, but for systems that have safety or economically critical requirements, exhaustive ver- ification is indispensable. Such exhaustive analysis can be performed with the use of formal verification methods. One approach to formal verification is model checking, which is a fully automated process based on the construction of abstract models to represent systems. These models are then checked against desired properties defining a specification, usually expressed in some temporal logic, such as linear temporal logic (LTL). Temporal properties can describe the ordering of events in time without introducing time explicitly, thereby being useful when verifying the possible executions of a system. This project aims to implement model checking algorithms that determine whether an LTL formula expressing a desired property is satisfied in a computing system

Using simulations and artificial life algorithms to grow elements of construction

'In nature, shape is cheaper than material', that is a common truth for most of the plants and other living organisms, even though they may not recognize that. In all living forms, shape is more or less directly linked to the influence of force, that was acting upon the organism during its growth. Trees and bones concentrate their material where thy need strength and stiffness, locating the tissue in desired places through the process of self-organization. We can study nature to find solutions to design problems. That’s where inspiration comes from, so we pick a solution already spotted somewhere in the organic world, that closely resembles our design problem, and use it in constructive way. First, examining it, disassembling, sorting out conclusions and ideas discovered, then performing an act of 'reverse engineering' and putting it all together again, in a way that suits our design needs. Very simple ideas copied from nature, produce complexity and exhibit self-organization capabilities, when applied in bigger scale and number. Computer algorithms of simulated artificial life help us to capture them, understand well and use where needed. This investigation is going to follow the question : How can we use methods seen in nature to simulate growth of construction elements? Different ways of extracting ideas from world of biology will be presented, then several techniques of simulated emergence will be demonstrated. Specific focus will be put on topics of computational modelling of natural phenomena, and differences in developmental and non-developmental techniques. Resulting 3D models will be shown and explained

Validating specifications of dynamic systems using automated reasoning techniques

In this paper, we propose a new approach to validating formal specifications of observable behavior of discrete dynamic systems. By observable behavior we mean system behavior as observed by users or other systems in the environment of the system. Validation of a formal specification of an informal domain tries to answer the question whether the specification actually describes the intended domain. This differs from the verification problem, which deals with the correspondence between formal objects, e.g. between a formal specification of a system and an implementation of it. We consider formal specifications of object-oriented dynamic systems that are subject to static and dynamic integrity constraints. To validate that such a specification expresses the intended behavior, we propose to use a tool that can answer reachability queries. In a reachability query we ask whether the system can evolve from one state into another without violating the integrity constraints. If the query is answered positively, the system should exhibit an example path between the states; if the answer is negative, the system should explain why this is so. An example path produced by the tool can be used to produce scenarios for presentations of system behavior, but can also be used as a basis for acceptance testing. In this paper, we discuss the use of planning and theoremproving techniques to answer such queries, and illustrate the use of reachability queries in the context of information system development

Regular Expressions in a CS Formal Languages Course

Regular expressions in an Automata Theory and Formal Languages course are mostly treated as a theoretical topic. That is, to some degree their mathematical properties and their role to describe languages is discussed. This approach fails to capture the interest of most Computer Science students. It is a missed opportunity to engage Computer Science students that are far more motivated by practical applications of theory. To this end, regular expressions may be discussed as the description of an algorithm to generate words in a language that is easily programmed. This article describes a programming-based methodology to introduce students to regular expressions in an Automata Theory and Formal Languages course. The language of instruction is FSM in which there is a regular expression type. Thus, facilitating the study of regular expressions and of algorithms based on regular expressions.Comment: In Proceedings TFPIE 2023, arXiv:2308.0611

Learning Author’s Writing Pattern System By Automata

The purpose of the report is to document our project’s theory, implementation and test results. The project works on an automata-based learning system which models authors’ writing characters with automatons. Since there were pervious works done by Dr. T.Y. Lin and Ms. S.X. Zhang, we continue on ALERGIA algorithm analysis and initial common pattern study in this project. Although every author has his/her own writing style, such as sentence length and word frequency etc, there are always some similarities in writing style. We hypothesize that common strings fogged the expected test result, just like the noise in radio wave. This report gives the design and implementation of finding common pattern, as well as testing results. This report also describes the implementation of ALERGIA algorithm based on paper of Learning Stochastic Regular Grammars by Means of a State Merging Method by Rafael C. Carrasco and Jose Oncina [2]. The coding is done in Java 6 on Eclipse Helios version