Theory of Automata

We propose a simple and intuitive algorithm for solving md-DFA problem using algorithm concepts within extended operators, our approach shows quadratic polynomial time and hence proves the equivalence between polynomial and non-polynomial classes, we have also shown that minimal nonemptiness of automata problem can be solved in polynomial time with help of modified subset construction, rather that building a product automaton, which lead to factorial size of the memory and time, in this work we also have used many non-tractable existing examples and computed them in polynomial time, which guarantees that our algorithm solves NP-complete problem in almost linear polynomial time, we have also avoided the problem of product automata by an algorithmic approach, we are also giving the starting ground for the proof of back-reference problem which was discussed before, notion to the globally local increment is also given as the main argument towards the resolution of "P versus NP" theorem, which coincides with the finitarity term in general mathematics.

The author of this novel theoretical book has a wide knowledge and more than ten years of steady research in the field of automata and complexity theory. The term “state complexity” comes from the fact that the state could be a formation of the absorbing complexity as to the date of our successful experience there were no best- known solutions for the regular expression matching with extended operators like intersection, subtraction and complement, which is better known as a “membership problem” – we present a delicate “proof of concept” on the scientific work which lays between classical notation of automata and complexity theory.

Analogy-based Text Normalization : the case of unknowns words. In this paper, we describe and evaluate a system for improving the quality of noisy texts containing non-word errors. It is meant to be integrated into a full information extraction architecture, and aims at improving its results. For each word unknown to a reference lexicon which is neither a named entity nor a neologism, our system suggests one or several normalization candidates (any known word which has the same lemma as the spell-corrected form is a valid candidate). For this purpose, we use an analogybased approach for acquiring normalisation rules and use them in the same way as lexical spelling correction rules. Mots-clés : normalisation textuelle, correction orthographique, analogie.

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

In this paper, a reflection is made on an indeterminism inherent to Hopcroft's minimization algorithm: the splitter choice. We have implemented two natural policies (FIFO and FILO) for managing the set of splitters for which we obtain the following practical results: the FILO strategy performs better than the FIFO strategy, in the case of a one letter alphabet, the practical complexity in the FILO case never exceeds a linear one and our implementation is more efficient than the minimization algorithm of the FSM tool. This implementation is being integrated in a finite automata library, the Dash library. Thus, we present an efficient manner to manipulate automata by using canonical minimal automata.

In this paper, a reflection is made on an indeterminism inherent to Hopcroft's minimization algorithm: the splitter choice. We have implemented two natural policies (FIFO and FILO) for managing the set of splitters for which we obtain the following practical results: the FILO strategy performs better than the FIFO strategy, in the case of a one letter alphabet, the practical complexity in the FILO case never exceeds a linear one and our implementation is more efficient than the minimization algorithm of the FSM tool. This implementation is being integrated in a finite automata library, the Dash library. Thus, we present an efficient manner to manipulate automata by using canonical minimal automata.

Consider a language, English or French, or maybe Perl or Java; however, there is a conventional definition that is significantly broader. It includes these dialects, and other theoretical dialects like the indivisible numbers, or the legitimate verifications of the 4-shading hypothesis. Start with a limited set, which is known as the letters in order. Think about all limited, arranged strings, i.e., limited tuples, drawn from this letter set. A language is any clear-cut subset of these strings. Each limited string in the language is known as a word. Since you have found out about strings, letter sets, words, and punctuation in the previous units, it will be simpler for you to comprehend the subject of conversation in this unit, which is formal language. You will see that dialects fall into different classes, as per their intricacy. A few dialects can be parsed, i.e., deciphered, by a basic state machine.

We give the definition of filter which is a rational relation between the repeated sequences in nondeterministic finite automata, we also show that it can be used in constructing deterministic automataon with respect to the filter condition.

This is an exposition of the well known theorem of Chomsky and Miller [1] a language is regular iff the language is generated by a left linear grammar. Def 1.1 A context free grammar is a Left Linear Grammar if every production is either of the form X → σY or X → σ where σ ∈ Σ ∪ {e}.

It is well known that the intersection of a context free language and a regular language is context free. This theorem is used in several proofs that certain languages are not context free. The usual proof of this theorem is a cross product construction of a PDA and a DFA. This requires the equivalence of PDA’s and CFG’s. Is there a proof that does not use the equivalence? That is, is

Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular automaton with a 2-linear time and display its spatial dynamics. Three particular Turing machines are converted in three universal one-dimensional cellular automata, they are: binary sum, rule 110 and a universal reversible Turing machine.

The recent work on implementing regular expression (RE) matching or membership problem solution for extended operators (ERE) like intersection, complement and subtraction gave exponential results on the size of input. As our previous result was focused on deterministic finite automata (DFA) for extended regular expressions, we present the new linear algorithm for ERE matching on non-deterministic finite automata (NFA) with the help of De Morgan's law to rewrite the expression in exceptional order so that the conditional matching satisfies the correctness of the matching algorithm on NFA. We also prove that the proposed methodology is correct within the extensions of NFA like logical states as it was done before for DFA in the prior scientific work. We will also show how to implement these logical states in NFA using typical constructions like Thompson's. The proof of linear working time is also given which is obvious due to the rewriting rules for correct implementation. The important role of concatenation operator over extended constructions is also shown. The algorithm working time is O(m*n), where m is the size of expression and n is the size of matching word.

While the past work was focused on limited set of regular expressions (RE) within extended operators like intersection, complement and subtraction (ERE), in this article we extend the definition of RE for zero-width operators like Kleene closure. For this purpose the tagged states are implemented within the space of states of the non-deterministic finite automata (NFA) as well as for modified subset construction of deterministic finite automata (DFA). The prior research is good for extended operators, however, empty words play vital role even in extended regular expression matching as well as for typical regular expressions. Thus, the tagged states and transitions are introduced as well as the local search, which was first developed for approximate back-reference matching and now is suitable for extended operators. Thus, the linear complexity isn't avoided and is obtained for the general case of the grammars of regular expressions. It's also shown that the limited set of grammar rules for regular expressions are the good idea to obtain preliminary results for further generalization using algorithmic paradigms.

Students are getting confused and losing interest in theoretical computer science because most instructors are doing a poor job in teaching the subject matter. Instructors are doing a poor job in teaching because they do not have a well-organized theory to explain the concepts and they are unwilling to spend the time to write up better lecture notes for the class. This paper presents a rigorous mathematical approach to the theory of context-free languages which doesn't currently exist in the literature of theoretical computer science. Basic definitions are developed in mathematical terms and used as the foundation for constructing mathematical proofs for theorems. It provides a model for instructors to write better lecture notes and authors to write better textbooks for educational purpose. It also corrects some critical errors and erroneous arguments that can be found in many textbooks which are widely used for the education of theoretical computer science. Students can use this paper for supplemental reading.

Students are getting confused and losing interest in theoretical computer science because most instructors are doing a poor job in teaching the subject matter. Instructors are doing a poor job in teaching because they do not have a well-organized theory to explain the concepts and they are unwilling to spend the time to write up better lecture notes for the class. This paper presents a rigorous mathematical approach to the theory of context-free languages which doesn't currently exist in the literature of theoretical computer science. Basic definitions are developed in mathematical terms and used as the foundation for constructing mathematical proofs for theorems. It provides a model for instructors to write better lecture notes and authors to write better textbooks for educational purpose. It also corrects some critical errors and erroneous arguments that can be found in many textbooks which are widely used for the education of theoretical computer science. Students can use this paper for supplemental reading. )

Students are getting confused and losing interest in theoretical computer science because most instructors are doing a poor job in teaching the subject matter. Instructors are doing a poor job in teaching because they do not have a well-organized theory to explain the concepts and they are unwilling to spend the time to write up better lecture notes for the class. This paper presents a rigorous mathematical approach to the theory of context-free languages which doesn't currently exist in the literature of theoretical computer science. Basic definitions are developed in mathematical terms and used as the foundation for constructing mathematical proofs for theorems. It provides a model for instructors to write better lecture notes and authors to write better textbooks for educational purpose. It also corrects some critical errors and erroneous arguments that can be found in many textbooks which are widely used for the education of theoretical computer science. Students can use this paper for supplemental reading. )

Paper ini membahas penerapan regular expression untuk memvalidasi nomor polisi kendaraan di Indonesia dengan menggunakan konsep teori bahasa otomata. Nomor polisi kendaraan di Indonesia memiliki format yang terstruktur, yang terdiri dari kode wilayah, nomor registrasi, dan huruf seri. Dalam penelitian ini, kami mengembangkan sebuah sistem untuk memverifikasi apakah nomor polisi yang dimasukkan sesuai dengan pola yang telah ditetapkan. Selain itu, program ini juga mengklasifikasikan jenis kendaraan berdasarkan nomor registrasi dan menentukan warna plat kendaraan sesuai dengan aturan yang berlaku. Penggunaan regular expression memungkinkan verifikasi yang efisien dan otomatis, sedangkan teori automata membantu dalam memahami dan merancang sistem ini berdasarkan pola-pola yang ada. Sistem ini diharapkan dapat digunakan sebagai referensi untuk aplikasi administrasi kendaraan bermotor di Indonesia.

Given a graph G of order n, the σ-polynomial of G is the generating function σ(G, x) = a i x i where a i is the number of partitions of the vertex set of G into i nonempty independent sets. Such polynomials arise in a natural way from chromatic polynomials. Brenti [1] proved that σ-polynomials of graphs with chromatic number at least n − 2 had all real roots, and conjectured the same held for chromatic number n − 3. We affirm this conjecture.

We show that the absolute worst case time complexity for Hopcroft's minimization algorithm applied to unary languages is reached only for deterministic automata or cover automata following the structure of the de Bruijn words. A previous paper by Berstel and Carton gave the example of de Bruijn words as a language that requires O(n log n) steps in the case of deterministic automata by carefully choosing the splitting sets and processing these sets in a FIFO mode for the list of the splitting sets in the algorithm. We refine the previous result by showing that the Berstel/Carton example is actually the absolute worst case time complexity in the case of unary languages for deterministic automata. We show that the same result is valid also for the case of cover automata and an algorithm based on the Hopcroft's method used for minimization of cover automata. We also show that a LIFO implementation for the splitting list will not achieve the same absolute worst time complexity for the case of unary languages both in the case of regular deterministic finite automata or in the case of the deterministic finite cover automata as defined by S. Yu.

Несколько замечаний вместо предисловия Книга написана по материалам занятий программированием со школьниками математических классов школы Ђ 57 г. Москвы и студентами младших курсов (Московский государственный университет, Независимый московский университет, университет г. Uppsala, Швеция). Книга написана в убеждении, что программирование имеет свой предмет, не сводящийся ни к конкретным языкам и системам, ни к методам построения быстрых алгоритмов. Кто-то однажды сказал, что можно убедить в правильности алгоритма, но не в правильности программы. Одна из целей книги | попытаться продемонстрировать, что это не так. В принципе, возможность практического исполнения программ не является непременным условием изучения программирования. Однако она является сильнейшим стимулом | без такого стимула вряд ли у кого хватит интереса и терпения. Выбранный жанр книги по необходимости ограничивает её «программированием в малом», оставляя в стороне необходимую часть программистского образования | работу по модификации больших программ. Автор продолжает мечтать о наборе учебных программных систем эталонного качества, доступных для модификации школьниками. Кажется, Хоар сказал, что эстетическая прелесть программы | это не архитектурное излишество, а то, что отличает в программировании успех от неудачи. Если, решая задачи из этой книги, читатель почувствует прелесть хорошо написанной программы, в которой «ни убавить, ни прибавить», и сомнения в правильности которой кажутся нелепыми, то автор будет считать свою цель достигнутой. Характер глав различен: в одних предлагается набор мало связанных друг с другом задач с решениями, в других по существу излагается один-единственный алгоритм. Темы глав во многом пересекаются, и мы предпочли кое-какие повторения формальным ссылкам. Уровень трудности задач и глав весьма различен. Мы старались включить как простые задачи, которые могут быть полезны для начинающих, так и трудные задачи, которые могут посадить в лужу сильного школьника. (Хоть и редко, но это бывает полезно.) Книги для чтения Предметный указатель Указатель имён 1. Переменные, выражения, присваивания 1. Переменные, выражения, присваивания 1. Переменные, выражения, присваивания Решение. Вариант 1. 1.2. Массивы 1.2.8. Та же задача, если известно, что все элементы массива | числа от 1 до k и число действий должно быть порядка n + k. 1.2.9. (Сообщил А. Л. Брудно) Прямоугольное поле m × n разбито на mn квадратных клеток. Некоторые клетки покрашены в чёрный цвет. Известно, что все чёрные клетки могут быть разбиты на несколько непересекающихся и не имеющих общих вершин чёрных прямоугольников. Считая, что цвета клеток даны в виде массива типа array [1..m] of array [1..n] of boolean; подсчитайте число чёрных прямоугольников, о которых шла речь. Чи

These lecture notes present some basic notions and results on Automata Theory, Formal Languages Theory, Computability Theory, and Parsing Theory. I prepared these notes for a course on Automata, Languages, and Translators which I am teaching at the University of Roma Tor Vergata. More material on these topics and on parsing techniques for context-free languages can be found in standard textbooks such as [1, 8, 9]. The reader is encouraged to look at those books. A theorem denoted by the triple k.m.n is in Chapter k and Section m, and within that section it is identified by the number n. Analogous numbering system is used for algorithms, corollaries, definitions, examples, exercises, figures, and remarks. We use 'iff' to mean 'if and only if'. Many thanks to my colleagues of the Department of Informatics, Systems, and Production of the University of Roma Tor Vergata. I am also grateful to my students and co-workers and, in particular, to

It is well-known that: (i) every context-free language over a singleton terminal alphabet is regular, and (ii) the class of languages that satisfy the Pumping Lemma is a proper super-class of the context-free languages. We show that any language in this superclass over a singleton terminal alphabet is regular. Our proof is based on a transformational approach and does not rely on Parikh's Theorem. Our result extends previously known results because there are languages that are not context-free, do satisfy the Pumping Lemma, and do not satisfy the hypotheses of Parikh's Theorem.

Несколько замечаний вместо предисловия Книга написана по материалам занятий программированием со школьниками математических классов школы Ђ 57 г. Москвы и студентами младших курсов (Московский государственный университет, Независимый московский университет, университет г. Uppsala, Швеция). Книга написана в убеждении, что программирование имеет свой предмет, не сводящийся ни к конкретным языкам и системам, ни к методам построения быстрых алгоритмов. Кто-то однажды сказал, что можно убедить в правильности алгоритма, но не в правильности программы. Одна из целей книги | попытаться продемонстрировать, что это не так. В принципе, возможность практического исполнения программ не является непременным условием изучения программирования. Однако она является сильнейшим стимулом | без такого стимула вряд ли у кого хватит интереса и терпения. Выбранный жанр книги по необходимости ограничивает её «программированием в малом», оставляя в стороне необходимую часть программистского образования | работу по модификации больших программ. Автор продолжает мечтать о наборе учебных программных систем эталонного качества, доступных для модификации школьниками. Кажется, Хоар сказал, что эстетическая прелесть программы | это не архитектурное излишество, а то, что отличает в программировании успех от неудачи. Если, решая задачи из этой книги, читатель почувствует прелесть хорошо написанной программы, в которой «ни убавить, ни прибавить», и сомнения в правильности которой кажутся нелепыми, то автор будет считать свою цель достигнутой. Характер глав различен: в одних предлагается набор мало связанных друг с другом задач с решениями, в других по существу излагается один-единственный алгоритм. Темы глав во многом пересекаются, и мы предпочли кое-какие повторения формальным ссылкам. Уровень трудности задач и глав весьма различен. Мы старались включить как простые задачи, которые могут быть полезны для начинающих, так и трудные задачи, которые могут посадить в лужу сильного школьника. (Хоть и редко, но это бывает полезно.

В основе любых криптографических алгоритмов и протоколов используются простейшие функции — перестановки и подстановки элементов заданного конечного множества. Объединяя и трансформируя данные элементы, организуется структурная ячейка защиты информации — атематическое преобразование, обладающее необходимой криптографической стойкостью. Главная проблема в выработке таких преобразованиях заключается в том, что в процессе формирования более мощных алгоритмов разработчики используют все больше данных и вычислительных мощностей, полагаясь при этом на аппаратные возможности информационной системы. Это не только увеличивает потребление ресурсов, но также ограничивает скорость и конфиденциальность приложений. Однако изучая математические аспекты формирования перестановок и систему счисления рядов факториальных множеств необходимо перейти к активному изучению проблемы накопления данных, чтобы предложить новые алгоритмы, которые уменьшают модели аппаратного хранения больших объемов перестаново...

Pumping lemma has been a very difficult topic for students to understand in a theoretical computer science course due to a lack of tool support. In this paper, we present an active learning tool called MInimum PUmping length (MIPU) educational software to explore the pumping lemma property for regular languages. For a given regular language, MIPU offers three major functionalities: determining the membership of an input string, generating a list of short strings that belong to the language, and automatically calculating the minimal pumping length of the language. The software tool has been developed to provide educational assistance to students to better understand the concepts of pumping lemma and minimum pumping length, and promote active learning through hand-on practice.

The paper constructs a generalized version of universal traversing sequences. The generalization preserves the features of the universal traversing sequences that make them attractive for applications to derandomizations and space-bounded computation. For every n, a sequence is constructed that is used by a finite-automaton with 0(1) states in order to traverse all the n-vertex labeled undirected graphs. The automaton walks on the graph; when it is at a certain vertex, it uses the edge labels and the sequence in order to decide which edge to follow. When walking on an edge, the automaton can see the edge labeling. The generalized sequences have size 2°(8(")) and traverse all the n-vertex undirected graphs G satisfying Diam(G) * log(A(G)) 5 a(n), 1 History of the problem and previous construct ions S. Cook introduced the concept of universal traversing sequence and asked the question of the existence of short, i.e., polynomial size, such sequences. R. Aleliunas (1978) (11 showed that such sequences of size O(nS) exist for 2-regular graphs. (The result was re-obtained

Временные, пространственные и равновесные средние непрерывных вектор-функций на фазовом пространстве динамической системы Для динамических систем τ с "временем" Z d и компактным фазовым пространством X мы вводим три подмножества пространства R m , связанные с непрерывной функцией f : X → R m : множество временных средних и два множества пространственных средних, отвечающих соответственно всем τ-инвариантным вероятностным мерам и некоторым равновесным мерам на X. Основные результаты статьи касаются топологических свойств этих множеств и их взаимного расположения. Библиография: 18 названий. Ключевые слова: динамическая система, пространственное среднее, равновесное среднее, временное среднее, давление. Работа первого автора выполнена при поддержке Российского фонда фундаментальных исследований (гранты № 07-01-92215 НЦНИ(Л) и № 08-01-00105).

Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields. Practically all of their related problems are decidable, so that they support automatic verification algorithms. Also, they can be recognized in real-time. Context-free languages (CFL) are another major family well-suited to formalize programming, natural, and many other classes of languages; their increased generative power w.r.t. RL, however, causes the loss of several closure properties and of the decidability of important problems; furthermore they need complex parsing algorithms. Thus, various subclasses thereof have been defined with different goals, spanning from efficient, deterministic parsing to closure properties, logic characterization and automatic verification techniques. Among CFL subclasses, so-called structured ones, i.e., those where the typical tree-structure is visible in the sentences, exhibit many of the algebraic and logic properties of RL, whereas deterministic CFL have been thoroughly exploited in compiler construction and other application fields. After surveying and comparing the main properties of those various language families, we go back to operator precedence languages (OPL), an old family through which R. Floyd pioneered deterministic parsing, and we show that they offer unexpected properties in two fields so far investigated in totally independent ways: they enable parsing parallelization in a more effective way than traditional sequential parsers, and exhibit the same algebraic and logic properties so far obtained only for less expressive language families.

Поведение дискретного спектра оператора Шрёдингера −∆ − V в значительной степени определяется поведением соответствующего ядра теплопроводности P (t; x, y) при t → 0 и t → ∞. В случае его степенных оценок P (t; • , •) L ∞ = O(t −δ/2), t → 0, P (t; • , •) L ∞ = O(t −D/2), t → ∞, естественно называть показатели δ , D локальной размерностью и размерностью на бесконечности соответственно. Характер спектральных оценок зависит от соотношения между этими размерностями. Мы рассматриваем случай δ < D, ранее изученный недостаточно. В качестве приложений рассматриваются операторы на комбинаторных и метрических графах.

Алтайский государственный университет, г. Барнаул, Россия Рассмотрены разбиения конечного множества на дизъюнктные подмножества, ближайшие к заданному (основному) разбиению в специальной кластерной метрике. Для фиксированного основного разбиения найдены вид ближайших к нему разбиений и их количество. На основе этого предложен статистический критерий для определения значимости отличий двух разбиений. Приводится пример обработки медицинских данных с помощью этого критерия. Ключевые слова: разбиения конечных множеств, кластерная метрика, статистическая значимость различия разбиений.

This paper presents a theory of runtime enforcement based on mechanism models called MRAs (Mandatory Results Automata). MRAs can monitor and transform security-relevant actions and their results. Because previous work could not model monitors transforming results, MRAs capture realistic behaviors outside the scope of previous models. MRAs also have a simple but realistic operational semantics that makes it straightforward to define concrete MRAs. Moreover, the definitions of policies and enforcement with MRAs are significantly simpler and more expressive than those of previous models. Putting all these features together, we argue that MRAs make good general models of runtime mechanisms, upon which a theory of runtime enforcement can be based. We develop some enforceability theory by characterizing the policies MRAs can and cannot enforce.

In this study, we investigated the pumping lemma for context-free languages and analyzed some case studies in terms of their efficiency. Pumping lemmas play an important role in formal language theory. Context-free languages (CFL) is the set of languages that can be defined by context-free grammars. Context-free grammars are used to define programming languages, natural language applications (such as grammar correctors), machine protocols and many others. The case studies are used to simplify the process analyses of the efficiency of pumping lemma for Context-Free Languages. To prove that a Language is Not Context-Free using pumping lemma for CFL, we created a guideline presented in the fourth section that contains a proposed algorithmic procedure. Pumping lemma for CFL is used to show the existence of non-context free languages. Insights and argumentations were provided in the end of the paper.

Пусть N-множество из N элементов и F1, F2,. . .-последовательность случайных независимых равновероятных отображений N → N. Для подмножества S0 ⊂ N , |S0| = n, рассматривается последовательность образов St = Ft(.. . F2(F1(S0)). . .), t = 1, 2. .. Получены условия на n, t и N , при которых распределение размеров образов St асимптотически нормально. Исследование выполнено за счет гранта Российского научного фонда (проект № 14-50-00005).

- Pergeseran paradigma ke arah digital dalam bidang perdagangan menuntut pengelolaan data pelanggan yang lebih efisien dan terstruktur di platform toko elektronik. Dalam menanggapi tantangan kompleksitas dan dinamika data pelanggan, penerapan teori bahasa otomata, terutama Finite State Automata (FSA), muncul sebagai solusi yang menjanjikan. Penelitian ini bertujuan untuk menunjukkan bagaimana penerapan FSA dapat membantu merancang sistem pengelolaan data pelanggan yang efektif.
Pendahuluan mengidentifikasi kompleksitas proses pengelolaan data pelanggan di toko elektronik, seperti kendala dalam identifikasi pelanggan, kekurangan otomatisasi registrasi, dan tantangan dalam melaksanakan transaksi secara efisien. Metode penelitian terstruktur dilakukan untuk mengidentifikasi masalah, merancang sistem dengan konsep FSA, dan mengimplementasikannya pada aplikasi pengelolaan data pelanggan.
Hasil dan pembahasan menyoroti langkah-langkah konkret, termasuk identifikasi masalah melibatkan analisis kebutuhan, perancangan sistem yang mencakup pembuatan flowchart, use case diagram, activity diagram, dan state diagram dengan menggunakan FSA. Hasil pemahasan juga memaparkan proses registrasi pelanggan, identifikasi status pelanggan, dan pelaksanaan transaksi melalui pendekatan FSA, diilustrasikan melalui diagram-diagram terintegrasi.
Kesimpulan penelitian menekankan keberhasilan penerapan FSA dalam merancang sistem pengelolaan data pelanggan yang meningkatkan efisiensi, ketepatan identifikasi, dan kualitas transaksi di toko elektronik. Referensi kepada konsep FSA memberikan landasan teoritis bagi pengembangan solusi ini dalam konteks teknologi informasi dan perdagangan elektronik.
Penelitian ini diharapkan memberikan kontribusi teoritis dan praktis terhadap pengembangan sistem pengelolaan data pelanggan di bisnis berbasis digital. Kesimpulan dan hasil penelitian ini diharapkan menjadi landasan untuk penelitian lanjutan dan mendorong adopsi konsep otomata dalam pengelolaan data yang semakin kompleks dan dinamis.

In papers [2] and [3] four criteria of complexity of context-free grammars (CFG&#39;s), denoted by Var, Lev, Lev„, and Depth, have been studied. These criteria reflect the intrinsic complexity of CFG&#39;s and they induce the criteria of complexity of contextfree languages (CFL&#39;s) which reflect the intrinsic complexity of the description of CFL&#39;s by CFG&#39;s. The criterion Prod (G) = the number of rules of a CFG G, studied in [3] represents the size of CFG&#39;s. In the present paper one more criterion of complexity of CFG&#39;s, namely Symb (G) = = the number of all occurrences of all symbols in the rules of G, is defined and some results concerning the criteria Prod and Symb are derived.

Cloud based systems(CBSs) are increasing in the computing world. These systems derive their complexity due to both the disparate components and the diverse stake holders involved in them. The component wise security alone does not solve the problem of securing CBSs, but the stakeholder's computational space spanning across many components of the CBS, needs to be secured too. There have been initial attempts to model the security of the cloud in terms of securing stakeholder's computational space. Some recent attempts formally model the CBS as modularized actor models, using rewriting & equational logic based modeling languages. Building on these works we present a framework for building executable models of CBSs for security analyses. We illustrate its validity showing how the recent security breaches and security solutions can be modeled and analyzed using this framework.

Diagnosa penyakit adalah sebuah program yang mencoba mendiagnosa suatu penyakit dari pertanyaan-pertanyaan berupa gejala-gejala yang diderita. Finite State Automata digunakan untuk menghimpun kemungkinan-kemungkinan yang terjadi dan melakukan pemetaan bagaimana proses diagnosa penyakit tersebut berjalan. Hasil dari penelitian ini adalah menerapkan konsep Finite State Automata dalam proses diagnosis tanaman.

parsing of string updates and user input Kyung-Goo Doh , Hyunha Kim, and David A. Schmidt ⋆⋆ 1 Hanyang University, Ansan, South Korea 2 Kansas State University, Manhattan, Kansas, USA Abstract. We extend our formulation of demand-driven, static-analysisbased, abstract parsing of the strings generated by PHP scripts to include strings that are generated from string-replacement operators and user input. Our approach combines LR(k)-parsing technology and data-flow analysis to analyze, in advance of execution, the documents generated dynamically by a script. String-replacement operations are computed statically by composing the finite-state automaton defined by a string replacement with the finite-state control of the LR(k)-parser, and user input is predicted and processed by characterizing the input by an LR(k)grammer and analyzing the strings generated by the grammer. Our work is implemented in Objective Caml. We extend our formulation of demand-driven, static-analysisbased, abstract ...

This paper shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of doxastic/epistemic PDL with a belief change modality. It is shown that the properties of knowledge and belief are preserved under any update, and that the logic is complete.

This paper shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of doxastic/epistemic PDL with a belief change modality. It is shown that the properties of knowledge and belief are preserved under any update, and that the logic is complete.

A matching M in a graph Γ is positive if Γ has a vertex-labeling such that M coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of Γ is an edge-partition M1,. .. , Mp of Γ such that Mi is a positive matching in Γ − M1 ∪ • • • ∪ Mi−1, for i = 1,. .. , p. The pmds of graphs are used to study algebraic properties of the Lovász-Saks-Schrijver ideals arising from orthogonal representations of graphs. We give a characterization of pmds of graphs in terms of alternating closed walks and apply it to study pmds of various classes of graphs including complete multipartite graphs, (regular) bipartite graphs, cacti, generalized Petersen graphs, etc. We further show that computation of pmds of a graph can be reduced to that of its maximum pendant-free subgraph.

We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of advised finite automata. The existence of an infinite hierarchy of classes of languages that can be recognized with the help of increasing numbers of inkdots as advice is shown. The effects of different forms of advice on the succinctness of the advised machines are examined. We also study randomly placed inkdots as advice to probabilistic finite automata, and demonstrate the superiority of this model over its deterministic version. Even very slowly growing amounts of space can become a resource of meaningful use if the underlying advised model is extended with access to secondary memory, while it is famously known that such small amounts of space are not useful for unadvised one-way Turing machines.