Finite State Automata

Abstract. This paper presents a software system called WebMonitoring. The system is designed for solving certain problems in the process of information search on the web. The first problem is improving entering of queries at search engines and enabling more complex searches than keyword-based ones. The second problem is providing access to web page content that is inaccessible by common search engines due to search engine’s crawling limitations or time difference between the moment a web page is set up on the Internet and the moment the crawler finds it. The architecture of the WebMonitoring system relies upon finite state machines and the concept of monitoring the web. We present the system’s architecture and usage. Some modules were originally developed for the purpose of the WebMonitoring system, and some rely on UNITEX, linguistically oriented software system. We hereby evaluate the WebMonitoring system and give directions for further development.

This paper presents a software system called WebMonitoring. The system is designed for solving certain problems in the process of information search on the web. The first problem is improving entering of queries at search engines and enabling more complex searches than keyword-based ones. The second problem is providing access to web page content that is inaccessible by common search engines due to search engine?s crawling limitations or time difference between the moment a web page is set up on the Internet and the moment the crawler finds it. The architecture of the WebMonitoring system relies upon finite state machines and the concept of monitoring the web. We present the system?s architecture and usage. Some modules were originally developed for the purpose of the WebMonitoring system, and some rely on UNITEX, linguistically oriented software system. We hereby evaluate the WebMonitoring system and give directions for further development.

We are to investigate the most common mistake in science and failure, which goes through the lenses of what is to be done and proved, thus, we give the full proof in this book according to “P versus NP” theorem by Stephen Cook, which was speculated as the way of what could be solved also can be verified – which is a common misinterpretation as we give the definition of tractability and feasibility of the non-solvable problems like NP-complete when the solution can be found only passing through the whole space of available variants – the number of these entities together form “too big” numbers which are not countable and are at least exponential as 2n. The classical NP-complete problem is a problem of Traveling Salesman Problem (TSP) by Hamilton, which shows that for n-cities there at least n! (factorial) number of possible solutions which are to be verified and, according to the verification procedure or step, they are to be chosen for the optimal one or the tour with the smallest possible function f(x), for each x that forms the path from the solution space.

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.

Algorithms for the inference of association with sequential information have been proposed and used but are ineffective, in some cases, because too many candidate rules are extracted. Filtering the relevant ones is usually difficult and inefficient. In this work, we present an algorithm for the inference of temporal association rules that uses context-free grammars to restrict the search process, in order to filter, in an efficient and effective way, the associations discovered by the algorithm. Moreover, we present experimental results that empirically evaluate its performance using synthetic data.

Regular expressions provide a flexible means for matching strings and they are often used in dataintensive applications. They are formally equivalent to either deterministic finite automata (DFAs) or nondeterministic finite automata (NFAs). Both DFAs and NFAs are affected by two problems known as amnesia and acalculia, and DFAs are also affected by a problem known as insomnia. Existing techniques require an automata conversion and compaction step that prevents the use of existing automaton databases and hinders the maintenance of the resulting compact automata. In this paper, we propose Parallel Finite State Machines (PFSMs), which are able to run any DFAor NFA-like state machines without a previous conversion or compaction step. PFSMs report, online, all the matches found within an input string and they solve the three aforementioned problems. Parallel Finite State Machines require quadratic time and linear memory and they are distributable. Parallel Finite State Machines make very fast distributed regular expression matching in data-intensive applications feasible.

Absrak UMKM memiliki peran strategis dalam perekonomian Indonesia, terutama dalam menciptakan lapangan kerja, mendorong pemerataan pendapatan, dan meningkatkan kesejahteraan masyarakat. Namun, dinamika pasar yang cepat dan perkembangan teknologi yang pesat menuntut pelaku UMKM untuk mampu beradaptasi secara efektif agar tetap kompetitif. Penelitian ini bertujuan untuk mengelompokkan strategi adaptasi UMKM di Pasar Menteng Pulo menggunakan algoritma K-Means. Data penelitian diperoleh melalui penyebaran kuesioner yang mencakup lima aspek utama strategi adaptasi, yaitu inovasi produk, distribusi, pemanfaatan teknologi, pengelolaan keuangan, dan strategi pemasaran. Data yang terkumpul kemudian dinormalisasi menggunakan metode Min-Max sebelum diproses dengan algoritma K-Means untuk membentuk tiga klaster strategi adaptasi. Hasil penelitian menunjukkan bahwa UMKM dapat dikelompokkan ke dalam tiga karakteristik strategi, yaitu strategi digital adaptif, strategi konvensional, dan strategi campuran. Selain itu, penelitian ini juga menghasilkan aplikasi berbasis Java dan MySQL yang berfungsi untuk memfasilitasi input data, menjalankan proses clustering, serta menyajikan hasil dalam bentuk tabel dan visualisasi grafik yang informatif, sehingga mendukung pengambilan keputusan dalam pembinaan UMKM.

In this thesis, we address the problem of fault identification in Petri nets: given a known Petri net and an unknown fault introduced to it, in terms of an additional (possibly unobservable) transition, we identify the fault, by only observing the executions of the system. We do this by translating the fault identification into a system of Integer Linear (In)Equations, which enable us to solve the problem using Integer Linear Programming. We prove its soundness, i.e., that the identified Petri net can indeed generate all the observed traces. Additionally, we observe and correct some inaccuracies in the existing literature in fault identification. We propose an approach to exploit the recent developments in the tools for checking satisfiability modulo theories. Through this approach, we empirically examine our research question, whether our fault identification technique is applicable in identifying faults in a number of examples. We have implemented the approach into a program that ...

We consider systems of equations of the form Xi=,IJ,a l &~LJ& i=l,...,n where A is the underlying alphabet, the Xi are variables, the Pi.0 are boolean functions in the variables J&B and each & is either the empty word or the empty set. The symbolsand u denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automaton, called boolean automaton, which is a generalization of a nondeterministic automaton. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

Grammatical inference and finite semigroup theory are continuously developing. Nevertheless it seems that they are not interacting too much. We propose in this paper an inference method for languages that belong to varieties of the form V * LI. Many well known families of languages like locally testable, reversible, dot-depth one, etc. are of that form. The method unifies existing algorithms for inference of some of those families and can be applied to some others that had not been inferred yet. It uses a result about the cascade product in which one of the factors is a transducer and the second is the automaton obtained by inferring the base case of the family using the transduction of the sample as input.

A new general method for inference of regular languages using nondeterministic automata as output has recently been developed and proved to converge. The aim of this paper is to describe and analyze the behavior of two implementations of that method and to compare it with two well known algorithms for the same task. A complete set of experiments has been carried out and the results of the new algorithms improve the existing ones both in recognition rates as in sizes of the output automata.

Constructing k independent sessions between k source-sink pairs with the help of a linear operation at each vertex is one of the most standard problems in network coding. For an unbounded k, this is known to be NP-hard. Very recently, a polynomial-time algorithm was given for k = 2 [Wang and Shroff, ISIT 2007], but was open for a general (constant) k. This paper gives a polynomial-time algorithm for this problem under the assumption that the size of the finite field for the linear operations is bounded by a fixed constant.

Abstract. We affirmatively settle the conjecture given by Kashefi, Nishimura and Vedral and complete a characterization of average-case quantum one-way permutations in terms of reflection operator and pseudo identity. We incorporate their basic idea with the universal hashing technique and modify the reduction between inverting quantum one-way permutation and the other problem appeared in the characterization of worst-case quantum one-way permutations given by them. Keywords: quantum one-way permutation, reflection ...

An XML publish/subscribe system needs to match many XPath queries (subscriptions) over published XML documents. The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large. Earlier solutions to this problem usually built large finite state automata for all the XPath subscriptions in memory. The scalability of this approach is limited by the amount of available physical memory. In this paper, we propose an implementation that uses a relational database as the matching engine. The heavy lifting part of evaluating a large number of subscriptions is done inside a relational database using indices and joins. We described several different implementation strategies and presented a performance evaluation. The system shows very good performance and scalability in our experiments, handling millions of subscriptions with moderate amount of physical memory.

Penelitian dan perancangan ini bertujuan untuk mengetahui populasi Muslim Middle Class dan memahami kebutuhan golongan sosial yang spesifik tersebut di Indonesia. Adapun latar belakang dari penelitian dan perancangan ini adalah jumlah muslim yang menjadi populasi agama terbesar di Indonesia yaitu 87,18% menurut sensus penduduk tahun 2010 dan menjadi yang terbesar pula di dunia yang mana secara alami membentuk golongan kelas sosial yaitu kelas bawah, menengah dan atas. Dengan pertumbuhan kota-kota di Indonesia, diantara wilayah perkotaan dan terbentuknya kelas sosial pada populasi muslim atau muslimah ini, pertumbuhan golongan kelas sosial tersebut pun melesat pada golongan tingkat menengah yang di sebut Muslim Middle Class, golongan ini memiliki kebutuhan yang khusus dan menyeluruh atau holistik, “Muslim Middle Class” ini walaupun membutuhkan kebutuhan yang hampir sama seperti golongan kelas sosial biasa, namun kebutuhan mereka juga memiliki nilai religiusitas selain daya beli yang ...

Abstrucr-The paper presents a new programming languagethe SLll finite-state automata specification and design language4esigned as a development tool for the Iskra 2000 multimicroprocessor telephone exchange software system [4], SLl is a concise and simple language used for the specification and design of finite-state automata and for the generation of the corresponding tables. The language is modular and structured, with control constructs inspired by the CCITT CHILL, only compile-time var.iables, simple macroprocessing facilities, and modest preprocessing facilities.

gopher.mit.edu • gopher.cs.uchicago.edu • anonymous ftp at mitpress.mit.edu • anonymous ftp at cs.uchicago.edu Vardi Rank Predicates vs. Progress Measures (Info) The Chicago Journal of Theoretical Computer Science is abstracted or indexed in Research Alert R , SciSearch R , Current Contents R /Engineering Computing & Technology, CompuMath Citation Index R .

gopher.mit.edu • gopher.cs.uchicago.edu • anonymous ftp at mitpress.mit.edu • anonymous ftp at cs.uchicago.edu Vardi Rank Predicates vs. Progress Measures (Info) The Chicago Journal of Theoretical Computer Science is abstracted or indexed in Research Alert R , SciSearch R , Current Contents R /Engineering Computing & Technology, CompuMath Citation Index R .

Automata models are among the computational models used in design and construction of industrial processes. Deterministic finite automata are used for specific operation procedures involving known start and specific accepting and or end states. This paper adopts the method of the deterministic finite automata to construct the compact production model by using the production processes to denote different states linked by different transition functions. The preliminary results indicate that from the compact model of the cement production processes the transition table so obtained can be used to interpret the order of the cement production process and a gateway towards studying more detailed transition matrix in terms of algebraic theoretic properties.

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}.

, Blok and Pigozzi have shown that a deterministic finite automaton can be naturally viewed as a logical matrix. Following this idea, we use a generalisation of the matrix concept to deal with other kind of automata in the same algebraic perspective. We survey some classical concepts of automata theory using tools from algebraic logic. The novelty of this approach is the understanding of the classical automata theory within the standard abstract algebraic logic theory.

We review, in a unified framework, translations from five different logics—monadic second-order logic of one and two successors (S1S and S2S), linear-time temporal logic (LTL), computation tree logic (CTL), and modal µ-calculus (MC)—into appropriate models of finite-state automata on infinite words or infinite trees. Together with emptiness-testing algorithms for these models of automata, this yields decision procedures for these logics. The translations are presented in a modular fashion and in a way such that optimal ...

We argue for the importance of function words to understand dialogues. In a spoken language dialogue system (SLDS), they play a crucial role in reconstructing users' assumptions about the domain of discourse. The paper gives examples providing evidence for that claim, presents an approach to parsing function words, and shows how their semantics can be integrated into a DRT-based semantic formalism. On that basis, we outline how function words in uence the assignment of speech acts to utterances, and in this way re ect the user's mental state. Finally, consequences of the approach to the theory and development of dialogue systems and their applications are discussed brie y.

We outline how utterances in dialogs can be interpreted using a partial first order logic. We exploit the capability of this logic to talk about the truth status of formulae to define a notion of coherence between utterances and explain how this coherence relation can ...

Abstract. This paper presents a software system called WebMonitoring. The system is designed for solving certain problems in the process of information search on the web. The first problem is improving entering of queries at search engines and enabling more complex searches than keyword-based ones. The second problem is providing access to web page content that is inaccessible by common search engines due to search engine’s crawling limitations or time difference between the moment a web page is set up on the Internet and the moment the crawler finds it. The architecture of the WebMonitoring system relies upon finite state machines and the concept of monitoring the web. We present the system’s architecture and usage. Some modules were originally developed for the purpose of the WebMonitoring system, and some rely on UNITEX, linguistically oriented software system. We hereby evaluate the WebMonitoring system and give directions for further development.

We present the salient features of a methodology for failure diagnosis of dynamic systems that can be modeled as discrete event systems. This methodology was introduced by Sampath et al. for centralized systems and subsequently extended by Debouk et al. for certain classes of decentralized systems. We discuss how to perform detection and identification of unobservable fault events using diagnosers, which are finite-state automata that are built from the discreteevent model of the system under consideration. Examples of diagnosers are given. Comparisons with other methodologies for diagnosing dynamic systems are given.

We present the continuation of studying Extended Regular Expression (ERE) on the view of modified subset construction within the overridden operators like intersection, subtraction, and rewritten complement. As before we have stated that in this case the complexity has a decreasing nature and tendency. We will give the strict definition of the operational part of this modified subset construction which is due to Rabin and Scott. The complexity of algorithm remains a magnitude less than NP-hard problems for which we have given the strict proof of equivalence in the prior work, so this work continues the studying of the comparable proof for a variety of problems to be computationally complex, however, explainable in terms of unified approach like operational calculus. In this calculus the general points of research are given to the representation of modified subset construction with at least two operands which are to be computed by subset construction and in terms of complexity of the effective algorithm they are computed using modified subset construction.

In this work we present the theoretical approach over solving the back-reference problem in regular expression matching within the almost polynomial time using local search within the memory, while within the growth of capturing groups we obtain the exponential results: for this purpose we develop the modified matching algorithm operating on non-deterministic finite automata within the modified search algorithm and presence of the specific method also over extended regular expressions. This is made due to the algorithm which can be adjusted for approximate searching allowing us to imply extended operators and features of modern regular expressions like intersection, subtraction and complement, as well as backreferences. The review of past work on this issues is also done: to the present time there is no discrete algorithm in systems like automata for local search. Thus, we obtain the new result of matching the pattern locally while the simulating algorithm works as usual. The obtained result also refers to the membership problem with local bound which can be set in the main algorithm presented in this article.

This article is descriptive qualitative research. The object of this research is language politeness. Speech, including polite language is very important to be considered by the participants of communication (speakers and partners said) for the smooth communication. However, the reality nowadays, the Indonesian people have been getting a lot of influence from outside (modernization) so that the polite language is getting faded. Thus, the sublime character as an eastern man is increasingly invisible. Therefore, the researcher is interested in studying language politeness as the impact of character education which has two goals. First, describe the values of language politeness in communicating during the learning process in the classroom. Second, the impact of language politeness on character education. Participants in this study include students in grade IX SMPN 4 Batam Island. Data collection methods used observation, interview, and documentation. The results of this study 1. The v...

This research aims to explore and find the determinant factors as it is important for the development of group UPPKS management in Kecamatan Sukarami Palembang through a quntitative descriptive approach.The number of respondents was limited for 7 groups that are still active in Kecamatan Sukarami. The result showed that the cooperative effort influence to productivity. The findings of this study indicate that the lack of funds/start-up capital has not gained sufficient leverage; the absence of other sources of funding, in fact, almost all are individual business, so that managed such as savings and credit groups. Growing effort is being supported by additional capital that sought its own members, as well as the selection of profitable business activities. Group leader and members favored form of technical training, certain items are more salable. More individual businesses selling food and beverages are for their money-faster turnaround, rest handicraft products do not sell quickly,...

In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service composition those behavioural requirements may be continually changing. This paper shows how the behavioural requirements in abstract service definitions (roles) can be dynamically and incrementally defined using constraints. These constraints are then used to generate finite state automata, which are used to check the compatibility of candidate services that have their behaviour expressed in static interface descriptions such as OWL-S. In addition to the development of services, Service-Oriented Computing (SOC) application development is a process consisting of service discovery, evaluation and composition. To support the composition of services, a variety of standards such as WSDL and SOAP have helped resolve the heterogeneity in implementation platforms. However, standardisations in the syntactic interface description of services (e.g. WSDL) alone are not sufficient to ensure the correct interoperation of services. Previous work in component-based software engineering suggests that there are four levels of component interface specification: syntactic, behavioural, synchronisation and QoS (Quality of Service) . In Web services, the need for semantically rich descriptions of services has resulted in a number of initiatives such as OWL-S and WSMO. In this paper we focus on behavioural interoperability, in particular the sequence of exchanged messages (protocols) between services. Of the above initiatives OWL-S provides explicit semantics for specifying the behaviour of services in its process model. OWL-S specifies its interaction in terms of definitions for atomic, simple and composite processes. WSMO, on the other hand, specifies the behavioural protocol of a service by using Abstract State Machines as the underlying formalism to represent the service's orchestration and choreography. WSMO also provides the specification of mediators to solve the mismatches at the data, communication protocol, and process levels. In contrast, rather than stipulating the existence of a new type of component in the Web services infrastructure, OWL-S provides to Web services and their clients the information that is needed to find existing mediators that can reconcile their mismatches .

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.

The problem addressed in this dissertation can be stated as follows: given as a query, a business process description within a Web service infrastructure, ef ciently nd business processes from a large repository that complementarily support the input query. In particular, the input business process enforces that some parts of the business process be mandatory. For example, a buyer organization using RosettaNet PIPs and the corresponding data dictionary might want to nd suppliers that use the same RosettaNet standard that ful ll his business process. In this case, for instance, a mandatory cancellation procedure of the processing would be executed after the order had been placed with the supplier. The current Web service standards around Universal Description, Discovery and Integration (UDDI) and related technologies do not address this problem as they offer only service discovery based on attribute/ value queries, that is limited to atomic service discovery. Research has shown that Business Process Execution Language for Web Services (BPEL4WS or BPEL for short), which is currently used to express business processes in Web service environments, does not have a solid formal model and thus lacks formal semantics for querying business process descriptions. This means that a formal model is required to express business processes and to enable their querying. Based on this formal model, appropriate indexing techniques are needed for ef cient querying in large service repositories. as well as the evaluation of annotations to realize intersection operations. However, the number of message sequences in an aFSA may be in nite due to cycles in the business process specication. In this dissertation a formal model for indexing and querying business processes is developed. The indexing approach is based on abstractions to transform aFSAs via their grammars into forms that can be indexed by available indexing mechanisms like B+-trees. The indexing approach is implemented and evaluated. Evaluation results show that the index outperforms sequential scanning by several orders of magnitude. An analysis of evaluation results also shows that the index scales well with increasing data set sizes and exhibits good computational properties for searching, being approximately linear on the number of aFSAs in the data collection. v Deutsche Zusammenfassung Die Problemstellung, die in dieser Dissertation adressiert wird, kann wie folgt beschrieben werden: eine Beschreibung eines Gesch äftsvorgangs, die in einer Web Service Infrastruktur in Form einer Abfrage vorgegeben ist, soll in einer großen Datenquelle ef zient Gesch äftsprozesse aufsp üren, die komplement är zur Eingabe-Abfrage sind. Insbesondere kann der Eingabe-Geschäftsprozess vorschreiben, dass einige Teile des Geschäftsvorgangs zwingend erforderlich sind. Zum Beispiel sucht ein Einkäufer, der eine bestimmte RosettaNet PIPs Beschreibung und das dazu geh örige Datenbeschreibungsverzeichnis einsetzt, einen Lieferanten, der ebenfalls demselben RosettaNet Standard folgt und somit auch den Geschäftsprozessen des Einkäufers entspricht. Nach Abschluss der Auftragsvergabe w ürde hier der Geschäftsvorgang zwingend beendet werden. Die derzeitigen, mit UDDI (Universal Description, Discovery and Integration) erstellten Webservice Technologien sowie verwandte Technologien sind nicht in der Lage dieses Problem zu l ösen, da diese zur Dienst ndung nur begrenzte Unterst ützung auf Attribute-/Wertebasierenden Abfragen anbieten k önnen und demnach auf die atomare Dienst ndung beschränkt ist. In der Forschung werden BPEL4WS oder BPEL (Business Process Execution Language f ür Web Services) zur Beschreibung von Geschäftsprozessen verwendet. Es hat sich gezeigt, dass diesen Sprachen ein solides, formales Modell und daher auch eine formale Semantik fehlt, um Abfragen von Geschäftsvorgangsbeschreibungen durchzuf ühren. Dies bedeutet, dass ein formales Modell ben ötigt wird, um Geschäftsprozesse darstellen zu k önnen und ihre Abfrage zu erm öglichen. Geeignete, auf einem solchen, formalen Modell aufbauende Techniken werden zur Indizierung ben ötigt, um Abfragen in großen Datenquellen ef zient gestalten zu k önnen. Ein Geschäftsprozess kann als eine Abfolge von Nachrichten beschrieben werden, wobei jede Nachricht eine m ögliche Sequenz in der Ausf ührung eines Vorgangs repräsentiert. Anhand dieses Modells kann durch Abgleichen der Geschäftsprozesse in der Datenquelle nach passenden Prozessen abgefragt werden. Der Abgleichvorgang ist de niert durch die Berechnung einer gemeinsamen Menge an Sequenznachrichten, die die zwingend notwendigen Teile enthalten. Die Semantik des Algorithmus zum Abgleich von Geschäftsprozessen kann durch Modellieren der endlichen Zustandsautomaten ( nal state automata, FSA), d. h. durch Anreichern mit aussagenlogischen Ausdr ücken, formalisiert werden. Diese angereicherten FSAs (aFSAs) k önnen Sequenznachrichten (m öglicherweise unendlich) in einem Geschäftsprozess ausdr ücken, während logische Ausdr ücke sowohl erforderliche als auch wahlfreie Teile des Geschäftsprozesses darstellen k önnen. Der Abgleich von Geschäftsprozessen ist formal de niert als die nicht leere Schnittmenge von aFSAs, die die erforderlichen Teile einer Geschäftsprozessbeschreibung enthalten. Die Schnittmenge von aFSAs zu berechnen ist rechenintensiv und mehr als quadratisch zur vi Anzahl der Zustände und übergänge. Ferner skaliert ein sequentielles Scannen von großen Datenquellen nicht bei der Suche nach passenden Geschäftsprozessen, auch wenn die einzelnen Abfrageoperationen einfach aufgebaut sind. Herk ömmlicherweise werden Indizes verwendet, um Anfragen in Datenbanken zu beschleunigen. Indizes zu schnittmengen-basierten Anfragen von aFSAs werden jedoch von Standard-Datenbank-Indexierungstechniken wie beispielsweise B + -tree nicht unterst ützt. Eine M öglichkeit ist, einen Index auf Basis von aFSA Sequenz- nachrichten und Annotationen zu erzeugen, Hier werden Sequenznachrichten-äquivalenz und die Auswertung der Kommentierungen f ür die Erstellung der Schnittmengen mit ber ücksichtigt. Die Anzahl der Sequenznachrichten in einer aFSA kann unendlich sein, da sich Schleifen in der Spezi kation des Geschäftsprozesses bilden k önnen. In dieser Dissertation wird ein formales Modell zur Indexierung und Abfrage von Geschäftsprozessen entwickelt. Der Ansatz zur Indexierung basiert auf Abstraktionen zur Transformation von aFSAs über die Grammatik in eine Struktur, die durch verf ügbare Indexierungsmechanismen wie z. B. B + -tree indiziert werden kann . Die Indexierungsl ösung wird implementiert und ausgewertet. Die Evaluierungsergebnisse zeigen, dass die Indexierung das sequentielle Scannen um mehrere Gr ößenordnungen übertrifft. Eine Analyse der Evaluierungsergebnisse zeigt dar über hinaus, dass der Index auch mit zunehmender Anzahl an Datensätzen gut skaliert und gute Recheneigenschaften bei der Suche aufweist, da die Suche sich linear zur Anzahl der aFSAs in der Datensammlung verhält.

The problem addressed in this dissertation can be stated as follows: given as a query, a business process description within a Web service infrastructure, efficiently find business processes from a large repository that complementarily support the input query. In particular, the input business process enforces that some parts of the business process be mandatory. For example, a buyer organization using RosettaNet PIPs and the corresponding data dictionary might want to find suppliers that use the same RosettaNet standard that fulfill his business process. In this case, for instance, a mandatory cancellation procedure of the processing would be executed after the order had been placed with the supplier. The current Web service standards around Universal Description, Discovery and Integration (UDDI) and related technologies do not address this problem as they offer only service discovery based on attribute/ value queries, that is limited to atomic service discovery. Research has shown...

The considered model is used in manual development of application specifications and is based on the theory of basic protocols and respective symbolic verification tools. Means to limit the behavioral characteristics of the model still matching the source requirements are discussed. If the model is verified successfully, the executable code of the application and the respective test code are generated from the model. The technique of using the developed model is described.Рассматривается модель, используемая при ручной разработке спецификаций приложения, созданная на основе теории базовых протоколов А.А. Летичевского и поддерживающего теорию инструментария символьной верификации. Обсуждаются способы ограничения поведенческих характеристик модели при условии сохранения соответствия исходным требованиям. По успешно верифицированной модели генерируется код приложения и код тестов. Приводится описание методики применения разработанной модели

The area of automatic groups has been one in which signiÿcant advances have been made in recent years. While it is clear that the deÿnition of an automatic group can easily be extended to that of an automatic semigroup, there does not seem to have been a systematic investigation of such structures. It is the purpose of this paper to make such a study. We show that certain results from the group-theoretic situation hold in this wider context, such as the solvability of the word problem in quadratic time, although others do not, such as ÿnite presentability. There are also situations which arise in the general theory of semigroups which do not occur when considering groups; for example, we show that a semigroup S is automatic if and only if S with a zero adjoined is automatic, and also that S is automatic if and only if S with an identity adjoined is automatic. We use this last result to show that any ÿnitely generated subsemigroup of a free semigroup is automatic.

This study examines the analysis of bankruptcy which uses a model Altman Z-Score 1983 once studied the effect of variable ratio of Working Capital to Total Assets (X1), Retained Earnings to Total Assets (X2), Earnings Before Interest and Tax to Total Assets (X3), Book Value of Equity to Book Value of Total Debt (X4), and Sales to Total Assets (X5) against bankruptcy for companies that went bankrupt or for companies that are not bankrupt by the number of samples (purposive sampling as a sampling technique ) as many as 15 companies. The purpose of this study is to analyze the financial ratios Altman model to explain the company's financial condition foods and beverages as a first step in anticipation of bankruptcy. The analysis method in this research is to perform calculations using the Altman Z-Score Revised (1983) and multinomial logit analysis. Testing is done with the first models prerequisite analysis, testing normality with the overall result is a variable based test One Sa...

This paper aims to analyze phubbing behavior in organizational leadership from an Islamic perspective. Researchers use this type of library research, namely research that seeks answers to problems through various library information such as books, encyclopedias, journals and other scientific documents. The nature of this research is descriptive analysis, namely regularly describing the data obtained, understood and described so that readers can understand it better. The data used in this research is secondary data. The reseach results show that phubbing behavior has serious impacts, not only detrimental to health but also psychological and even social. Communication within an organization is very important to achieve common goals. A leader is required to have good communication with his members. If a leader engages in phubbing behavior towards his members, it will have an impact on the quality of their work. Leaders who have good communication tend to be able to motivate their members to achieve goals. On the other hand, if a leader tends to ignore his members with phubbing behavior, his members will also be half-hearted in achieving their goals. In Islam it is also recommended to speak kind words and not hurt other people's feelings.

This paper presents a comprehensive examination of the underlying structures and behaviours of finite group automata and group machines, delving into their intricate relationships and properties. Researchers have developed a comprehensive structure for finite group automata applicable to any finite group. Their work utilizes state complexity (SC) and accepting state complexity (ASC) as key metrics. They have also computed syntactic and quotient complexities (SNC and QC) specifically for cyclic groups. While the primary emphasis lies on cyclic groups, their versatile methodology establishes a foundation for broadening these complexity analyses to encompass other categories of finite groups. Building upon existing research on finite group automata, this study investigates the structures of group machines, group machine recognizers, and their properties, including strong connectivity, cyclicality, perfection, bideterminism, and permutation behaviours. Our analysis reveals the interconnected nature of group machines and group machine recognizers, shedding light on their distinct characteristics. A key finding of this research is that all group machines are finite group automata, although the converse is not always true. By differentiating these structures based on their properties, we can effectively handle machines according to their characteristics. This study contributes to the advancement of research in this field by providing a thorough understanding of the fundamental structures and behaviours of finite group automata and group machines, ultimately enriching the theoretical foundations of computational models.

In this paper, we shall formulate and address a problem of covert actuator attacker synthesis for cyber-physical systems that are modeled by discrete-event systems. We assume the actuator attacker partially observes the execution of the closedloop system and is able to modify each control command issued by the supervisor on a specified attackable subset of controllable events. We provide straightforward but in general exponential-time reductions, due to the use of subset construction procedure, from the covert actuator attacker synthesis problems to the Ramadge-Wonham supervisor synthesis problems. It then follows that it is possible to use the many techniques and tools already developed for solving the supervisor synthesis problem to solve the covert actuator attacker synthesis problem for free. In particular, we show that, if the attacker cannot attack unobservable events to the supervisor, then the reductions can be carried out in polynomial time. We also provide a brief discussion on some other conditions under which the exponential blowup in state size can be avoided. Finally, we show how the reduction based synthesis procedure can be extended for the synthesis of successful covert actuator attackers that also eavesdrop the control commands issued by the supervisor.

Navigation within the scope of a Networked Collaborative Virtual Environment (NCVE) using an articulated body representation is mores complex then just moving the viewpoint based on user input. In such context, navigation englobes problems such as mapping of user's actions on the embodiment and body constraints in addition to the usual ones such as universal support for different devices and global motion constraints. We take a broader look at the problems, clasify them and present a solution for navigation in NCVEs. Basic navigation involves using some input device to control walk-through or fly-through motion. In the context Permission to make digit&hard copies of all or part of this material for personal or classroom use is granted without fee provided that the copies ore not made or distributed for profit or commercial advantage, the copyright notice, the title ofthe publication nnd its dote appear, and notice is given that copyright is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires specific permission and/or fee ACM K%YT '97 Lausanne Switzerland Copyright I997 ACM 0-89791-953-x/97/9.,%3.50