Intelligent Bio-inspired Approach for Secrecy Management in the Cloud

В цифровую эпоху в процессе автоматизации, роботизации различных отраслей производства и внедрения в него искусственного интеллекта используется уже трудно обозримое множество языков программирования. В результате в подготовке будущих инженеров все большое значение приобретает теория формальных языков, лежащая в основе разработки языков программирования. Незнание теории формальных языков стало причиной многих ошибок в разработке и использовании языков программирования в высокотехнологичных отраслях производства. Поэтому необходимо внедрение в содержание подготовки будущих инженеров дисциплины «Элементы теории формальных языков» для овладения ими теорией и практикой языков программирования. Установлено, что в методической литературе не разработаны эффективные методы обучения будущих инженеров формальным языкам. Цель статьи заключается в исследовании важных математических и методических аспектов обучения теории формальных языков будущих инженеров. Ведущую роль в исследовании играли методология дискретной математики и абстрактной алгебры, культурологический подход и методика преемственности в обучения между школой и вузом в содержании подготовки будущих инженеров. Результаты исследования. Охарактеризована культурологическая роль дискретной математики в современной теории формальных языков. На основе анализа избранных трудов В. М. Глушкова, Д. Кнута и других ученых исследована фундаментальная роль формальных языков абстрактной алгебры в обучении теории формальных языков. Охарактеризованы алгебраические аспекты методики обучения теории формальных языков и грамматик и роль в этой методике классических понятий абстрактной алгебры и их свойств. На основе этого изложены элементы методики преемственности в обучении элементам теории формальных языков будущих инженеров. В этих элементах важную роль играют различные трактовки понятия «язык» и примеры языков из математики и информатики. Раскрыта важная роль грамматик формальных языков в дальнейшем обучении этой теории. Результаты статьи имеют важное теоретическое и практическое значение в дальнейшем исследовании проблем методологии обучения будущих инженеров элементам теории формальных языков. Они представляют интерес для преподавателей, ведущих профессиональную подготовку студентов инженерных направлений в сфере автоматизации, роботизации отраслей производства и внедрения в него Искусственного интеллекта. In the digital era, in the process of automation, robotization of various industries and the introduction of Artificial Intelligence into it, numerous programming languages are widely applied. As a result, the theory of formal languages ​that underlies the development of programming languages is becoming increasingly important in the training of engineering students. The nescience of formal languages theory has caused many mistakes in the development and use of programming languages ​in high-tech industries. Therefore, it is necessary to introduce the discipline "Elements of the Theory of Formal Languages" into the content of the training of future engineers in order to master the theory and practice of programming languages. At the same time, it was established that the methodological literature hasn’t developed effective methods for teaching future engineers to formal languages. The purpose of the article is to investigate important mathematical and methodological aspects of teaching the theory of formal languages ​to engineering students. The leading role in the study was played by the methodology of discrete math and abstract algebra. Also, the cultural approach and the methodology of pre-graduation in training between school and university in the content of training future engineers. Findings.The cultural role of discrete mathematics in the modern theory of formal languages is determined in the article. Based on the analysis of selected works of V.M. Glushkov, D. Knut, and other scientists, the article investigates the fundamental role of formal languages ​of abstract algebra in teaching the theory of formal languages. Algebraic aspects of teaching methodology of the theory of formal languages ​and grammars, and the role in this methodology of classical concepts of abstract algebra and their propertieshave also become the subjects of the study. Basing on this, the elements of the methodology of continuity in teaching the elements of the theory of formal languages of future engineers are set out in the article. Various interpretations of the concept of "language" and examples of languages from mathematics, and computer science play an important role in these elements. The research also states the important role of grammars of formal languages in the further training of this theory. The findings of the research have important theoretical and practical significance in the further study of the issues of the methodology for teaching future engineers to the elements of the theory of formal languages. They are of interest to teachers conducting the professional training of engineering students in the field of automation, robotization of production industries, and the introduction of Artificial Intelligence into it.

We introduce a meta-model based on formal languages, dubbed formal choreographic languages, to study message-passing systems. Our framework allows us to generalise standard constructions from the literature and to compare them. In particular, we consider notions such as global view, local view, and projections from the former to the latter. The correctness of local views projected from global views is characterised in terms of a closure property. We consider a number of communication properties -- such as (dead)lock-freedom -- and give conditions on formal choreographic languages to guarantee them. Finally, we show how formal choreographic languages can capture existing formalisms; specifically we consider communicating finite-state machines, choreography automata, and multiparty session types. Notably, formal choreographic languages, differently from most approaches in the literature, can naturally model systems exhibiting non-regular behaviour.

The essay is divided into four Parts A to D: Part A (Sections 1 to 3), Topic and background; B. Grammatical description (Sections 4 to 6); C. Grammars and theories of language: motivating axiomatization (Sections 7 to 9); and D. Grammars as axiomatic theories (Sections 10 and 11). The essay characterizes grammatical description, both informal and formal, from a realist point of view as the description of abstract objects, not to be confused with the concrete data to which the description must be ultimately related. The importance of theories of natural human languages for grammars is emphasized, also in view of comparative grammar writing, and is demonstrated by the detailed analysis of a grammatical statement taken from an informal grammar. There is a discussion of adequacy problems that arise in current frameworks for formal grammars due to an absence of theories of language from such frameworks. A format for axiomatic grammars is outlined by which an axiomatic grammar ‘presupposes’ a theory of language, in a technical sense. The view of grammars is non-reductionist; concepts of theory integration are characterized that allow us to integrate grammars with linguistic and non-linguistic theories. The conception of linguistics itself is non-reductionist, too, through applying a concept of inter-discipline that relates linguistics to other disciplines.

This is a paper on Stone duality in computer science with special focus on topics with applications in formal language theory. In Section 2 we give a general overview of Stone duality in its various forms: for Boolean algebras, distributive lattices, and frames. For distributive lattices, we discuss both Stone and Priestley duality. We identify how to move between the different dualities and which dual spaces carry the Scott topology. We then focus on three themes. The first theme is additional operations on distributive lattices and Boolean algebras. Additional operations arise in denotational semantics in the form of predicate transformers. In verification they occur in the form of modal operators. They play an essential role in Eilenberg's variety theorem in the form of quotient operations. Quotient operations are unary instantiations of residual operators which are dual to the operations in the profinite algebras of algebraic language theory. We discuss additional operations in Section 3. The second theme is that of hyperspaces, that is, spaces of subsets of an underlying space. Some classes of algebras may be seen as the class of algebras for a functor. In the case of predicate transformers the dual functors are hyperspace constructions such as the Plotkin, Smyth, and Hoare powerdomain constructions. The algebras-for-a-functor point of view is central to the coalgebraic study of modal logic and to the solution of domain In the algebraic theory of formal languages various hyperspace-related product constructions, such as block and Schutzenberger products, are used to study complexity hierarchies. We describe a construction, similar to the Schutzenberger product, which is dual to adding a layer of quantification to formulas describing formal languages. We discuss hyperspaces in Section 4. The final theme is that of equations. These are pairs of elements of dual spaces. They arise via the duality between subalgebras and quotient spaces and have provided one of the most successful tools for obtaining decidability results for classes of regular languages. The perspective provided by duality allows us to obtain a notion of equations for the study of arbitrary formal languages. Equations in language theory is the topic of Section 5.

Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and elegant proofs of classic results in language theory. In this article, we study this representation in the Isabelle proof assistant. We define regular operations on infinite tries and prove the axioms of Kleene algebra for those operations. Thereby, we exercise corecursion and coinduction and confirm the coinductive view being profitable in formalizations, as it improves over the set-of-words view with respect to proof automation.

We introduce geometric consideration into the theory of formal languages. We aim to shed light on our understanding of global patterns that occur on infinite strings. We utilise methods of geometric group theory. Our emphasis is on large scale geometries. Two infinite strings have the same large scale geometry if there are colour preserving bi-Lipschitz maps with distortions between the strings. Call these maps quasi-isometries. Introduction of large scale geometries poses several questions. The first question asks to study the partial order induced by quasi-isometries. This partial order compares large scale geometries; as such it presents an algebraic tool for classification of global patterns. We prove there is a greatest large scale geometry and infinitely many minimal large scale geometries. The second question is related to understanding the quasi-isometric maps on various classes of strings. The third question investigates the sets of large scale geometries of strings accepted by computational models, e.g. Buchi automata. We provide an algorithm that describes large scale geometries of strings accepted by Buchi automata. This links large scale geometries with automata theory. The fourth question studies the complexity of the quasi-isometry problem. We show the problem is Σ 3 0-complete thus providing a bridge with computability theory. Finally, the fifth question asks to build algebraic structures that are invariants of large scale geometries. We invoke asymptotic cones, a key concept in geometric group theory, defined via model-theoretic notion of ultra-product. Partly, we study asymptotic cones of algorithmically random strings thus connecting the topic with algorithmic randomness.

The following text is the result of a hermeneutic study of chapter III "Natural language and formal language" of "Sémiosis et pensée humaine. Registres sémiotiques et apprentissage intellectuels" by Raymond published in 1995 in French, and in 2004 in the first version in Spanish. The aim of this study was to infer the theoretical elements of natural language and formal language that impact the teaching and learning processes of mathematical concepts

Written for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open.

Grammatical inference (also known as grammar induction) is a field transversal to a number of research areas including machine learning, formal language theory, syntactic and structural pattern recognition, computational linguistics, computational biology, and speech recognition. Specificities of the problems that are studied include those related to data complexity. We argue that there are three levels at which data complexity for grammatical inference can be studied: at the first (inner) level the data can be strings, trees, or graphs; these are nontrivial objects on which topologies may not always be easy to manage. A second level is concerned with the classes and the representations of the classes used for classification; formal language theory provides us with an elegant setting based on rewriting systems and recursivity, but which is not easy to work with for classification or learning tasks. The combinatoric problems usually attached to these tasks prove to be indeed difficult. The third level relates the objects to the classes. Membership may be problematic, and this is even more the case when approximations (of the strings or the languages) are used, for instance in a noisy setting. We argue that the main difficulties arise from the fact that the structural definitions of the languages and the topological measures do not match.

The theory of traces belongs to both formal language theory and the theory of concurrent systems. In both these disciplines it is a well-recognized and dynamic research area. Within formal language theory it yields the theory of partially commutative monoids, and provides an important connection between languages and graphs. Within the theory of concurrent systems it provides an important formal framework for the analysis and synthesis of concurrent systems. This monograph covers all important research lines of the theory of traces - each chapter of the book is devoted to one research line and is written by leading experts. It is organized in such a way that each chapter can be read independently - and hence is suitable for advanced courses/seminars on formal language theory and the theory of concurrent systems.

Almost four decades have passed since Formal Grammars first appeared in 1974. At that time it was still possible to rather comprehensively review for (psycho)linguists the relevant literature on the theory of formal languages and automata, on their applications in linguistic theory and in the psychology of language. That is no longer feasible. In all three areas developments have been substantial, if not breathtaking. Nowadays, an interested linguist or psycholinguist opening any text on formal languages can no longer see the wood for the trees, as it is by no means evident which formal, mathematical tools are really required for natural language applications. An historical perspective can be helpful here. There are paths through the wood that have been beaten since decades; they can still provide useful orientation. The origins of these paths can be traced in the three volumes of Formal Grammars, brought together in the present re-edition. In a newly added postscript the author has sketched what has become, after all these years, of formal grammars in linguistics and psycholinguistics, or at least some of the core developments. This chapter may provide further motivation for the reader to make a trip back to some of the historical sources.

Introductory notions - preliminaries words and languages regular and context-free languages - regular languages rewriting systems and grammars context-free languages pushdown automata algorithm aspects - partial recursive functions recursively enumerable languages context-sensitive languages applications - codes biological applications.

Grammar inference deals with determining (preferably simple) models/grammars consistent with a set of observations. There is a large body of research on grammar inference within the theory of formal languages. However, there is surprisingly little known on grammar inference for graph grammars. In this article, we take a further step in this direction and work within the framework of node label controlled (NLC) graph grammars. Specifically, given a graph G and a set 𝒮 of disjoint and isomorphic subgraphs of G, we characterize whether or not there is a graph grammar consisting of one production such that G may be derived from G0, the graph obtained from G by ‘contraction’ of each subgraph in 𝒮 to a node labelled by N. This generalizes a previous result that assumes boundary NLC graph grammars, and leads one to consider the more involved ‘non-confluent’ graph grammar rules.

Event structures and trace monoids

Global choreographies define the rules that peers should respect in their interaction, with the aim of guaranteeing interoperability. An abstract choreography can be seen as a protocol specification; it does not refer to specific peers and, especially in an open application domain, it might be necessary to retrieve a set of web services that fit in it. A crucial issue, that is raising attention, is verifying whether the business process of some peers, in particular the parts that encode the communicative behavior, will produce interactions which are conformant to the agreed protocol (legality issue). Such issue is tackled by the so called conformance test, which is a means for certifying the capability of interacting of the involved parts: two peers that are proved conformant to a same protocol will actually interoperate by producing a legal conversation. This work proposes an approach to the verification of a priori conformance of a business process to a protocol, which is based on the theory of formal languages and guarantees the interoperability of peers that are individually proved conformant.Keywordsweb service interaction protocolsconformance testformal verificationfinite state automata