Στην εργασία αυτή επεκτείνουμε το μοντέλο των πρωτοκόλλων πληθυσμών που προτάθηκε από τους Angluin et al., ούτως ώστε να μοντελοποιήσουμε πιο ισχυρά δίκτυα αποτελούμενα από πολύ μικρά τεχνουργήματα περιορισμένων πόρων (πράκτορες), τα οποία είναι πιθανόν να ακολουθούν μη προβλέψιμη παθητική κίνηση. Οι πράκτορες αυτοί επικοινωνούν μόνο κατά ζεύγη σύμφωνα με τις επιλογές ενός εχθρικού δρομολογητή. Ένας κατευθυνόμενος (ή μη κατευθυνόμενος) γράφος επικοινωνίας αποτυπώνει την ακόλουθη πληροφορία: κάθε ακμή (u,υ) του γράφου υποδηλώνει ότι επιτρέπεται κατά τον υπολογισμό να συμβούν μία ή περισσότερες αλληλεπίδρασεις του u με τον υ στις οποίες ο u είναι ο μυητής και ο υ ο αποκρινόμενος. Το νέο χαρακτηριστικό του μοντέλου των πρωτοκόλλων πληθυσμών με διαμεσολαβητή το οποίο προτείνουμε στην παρούσα εργασία είναι η ύπαρξη ενός παθητικού παρόχου επικοινωνίας τον οποίο καλούμε διαμεσολαβητή. Ο διαμεσολαβητής είναι μία απλή βάση δεδομένων με δυνατότητες επικοινωνίας. Βασική δουλειά του είναι να διατηρεί τις επιτρεπόμενες αλληλεπιδράσεις σε κλάσεις επικοινωνίας, των οποίων ο αριθμός είναι σταθερός και ανεξάρτητος του μεγέθους του πληθυσμού. Για τον λόγο αυτό υποθέτουμε ότι κάθε πράκτορας του πληθυσμού έχει έναν μοναδικό προσδιοριστή (ίσως εργοστασιακό) τον οποίο ο ίδιος δεν μπορεί να γνωρίζει. Όταν δύο πράκτορες πρόκειται να αλληλεπιδράσουν αποστέλλουν τους μοναδικούς προσδιοριστές τους (ταυτότητες) στον διαμεσολαβητή ο οποίος τους κοινοποιεί την κλάση στην οποία ανήκει το μεταξύ τους κανάλι επικοινωνίας (δηλαδή, την κατάσταση του κατευθυνόμενου ή μη ζεύγους των προσδιοριστών τους) και οι πράκτορες ανανεώνουν την κατάστασή τους και την κατάσταση της μεταξύ τους ακμής βάσει μίας καθολικής συνάρτησης μετάβασης. Εάν η μεταξύ τους αλληλεπίδραση δεν επιτρέπεται ή, με άλλα λόγια, αν το ζεύγος αυτό δεν υπάρχει στη βάση δεδομένων του διαμεσολαβητή οι πράκτορες ενημερώνονται ότι θα πρέπει να ματαιώσουν την αλληλεπίδραση. Παρατηρούμε ότι με τον τρόπο αυτό αρχίζουμε να αποκτούμε κάποιον έλεγχο σχετικά με την ασφάλεια του δικτύου και επιπλέον μέσω του διαμεσολαβητή μπορούμε ανά πάσα στιγμή να γνωρίζουμε την τοπολογία του δικτύου. Ισοδύναμα, είναι σα να επιτρέπουμε στις ακμές του γράφου επικοινωνίας να διατηρούν καταστάσεις από ένα σύνολο καταστάσεων ακμών σταθερού πληθικού αριθμού. Ο εναλλακτικός αυτός τρόπος να δούμε το νέο μοντέλο έχει πολλά πλεονεκτήματα ως προς την τυπική μοντελοποίηση και τον σχεδιασμό πρωτοκόλλων, αφού μας επιτρέπει να παραβλέψουμε τις λεπτομέρειες υλοποίησης του διαμεσολαβητή. Επιπρόσθετα, επεκτείνουμε περαιτέρω το νέο μοντέλο επιτρέποντας στις ακμές να έχουν κόστη από ένα, επίσης, σταθερού πληθικού αριθμού σύνολο, τα οποία είναι μόνο προς ανάγνωση. Εν συνεχεία, επιτρέπουμε στους κανόνες μεταβάσεων των εκάστοτε πρωτοκόλλων να διαβάζουν τις καταστάσεις του ζεύγους πρακτόρων που αλληλεπιδρούν και την κατάσταση και το κόστος της ακμής μέσω της οποίας γίνεται η αλληλεπίδραση (αν, φυσικά, έχουμε ορίσει κόστη στο πρόβλημά μας) και να ανανεώνουν όλα αυτά τα στοιχεία πέραν από τα κόστη που είναι μόνο προς ανάγνωση. Παρατηρούμε, επομένως, ότι οι προδιαγραφές των πρωτοκόλλων του νέου μοντέλου συνεχίζουν, να είναι ανεξάρτητες του μεγέθους του πληθυσμού και συνεχίζουν να μην χρησιμοποιούν μοναδικούς προσδιοριστές, δηλαδή, το νέο μοντέλο διατηρεί τα χαρακτηριστικά της κλιμάκωσης, της ομοιομορφίας και της ανωνυμίας. Τα Πρωτόκολλα Πληθυσμών με Διαμεσολαβητή (Mediated Population Protocols - MPP) που προτείνουμε μπορούν να υπολογίσουν σταθερά ιδιότητες γράφων σχετικά με τον γράφο επικοινωνίας. Για να το δείξουμε αυτό παρουσιάζουμε πρωτόκολλα για το μεγιστοτικό ταίριασμα, την μεταβατική θήκη, τις ακμές ελαχίστου κόστους και το ελάχιστο μονοπάτι από τη ρίζα ως τα φύλλα ενός έξω-κατευθυνόμενου δέντρου και αποδεικνύουμε την ορθότητά τους. Εν συνεχεία, δείχνουμε ότι το μοντέλο των πρωτοκόλλων με διαμεσολαβητή αποτελεί ένα ισχυρότερο υπολογιστικά μοντέλο από το κλασικό μοντέλο των πρωτοκόλλων πληθυσμών. Πρώτα παρατηρούμε το προφανές, ότι, δηλαδή, το κλασικό μοντέλο των πρωτοκόλλων πληθυσμών είναι ειδική περίπτωση του νέου μοντέλου, άρα το νέο μοντέλο μπορεί να κάνει σίγουρα τουλάχιστον ότι και το κλασικό. Εν συνεχεία, παρουσιάζουμε ένα πρωτόκολλο με διαμεσολαβητή το οποίο υπολογίζει σταθερά το γινόμενο δύο θετικών ακέραιων στην περίπτωση που ο G (γράφος επικοινωνίας) είναι πλήρης κατευθυνόμενος και συνεκτικός. Τα κατηγορήματα που περιλαμβάνουν πολλαπλασιασμό δύο ακέραιων μεταβλητών δεν είναι ημιγραμμικά και έχει αποδειχθεί ότι τα κλασικά πρωτόκολλα πληθυσμών σε πλήρεις γράφους υπολογίζουν σταθερά μόνο ημιγραμμικά κατηγορήματα, άρα με τον τρόπο αυτό δείχνουμε ότι υπάρχει τουλάχιστον ένα κατηγόρημα που ενώ δεν υπολογίζεται σταθερά απ'' το βασικό μοντέλο υπολογίζεται σταθερά από το μοντέλο το οποίο προτείνουμε. Για τις ανάγκες της απόδειξης διατυπώνουμε και αποδεικνύουμε ένα γενικό Θεώρημα σχετικά με τη σύνθεση δύο πρωτοκόλλων πληθυσμών με διαμεσολαβητή, το ένα εκ των οποίων χρησιμοποιεί σταθεροποιούμενες εισόδους. Δείχνουμε, επίσης, ότι όλα τα κατηγορήματα που υπολογίζονται σταθερά απ'' το μοντέλο μας ανήκουν (μη ομοιόμορφα) στην κλάση NSPACE(m), όπου το m συμβολίζει το πλήθος των ακμών του γράφου επικοινωνίας. Τέλος, ορίζουμε τα πιθανοτικά πρωτόκολλα πληθυσμών με διαμεσολαβητή, στα οποία ο δρομολογητής επιλέγει σε κάθε βήμα την επόμενη αλληλεπίδραση ισοπίθανα μεταξύ των ακμών του γράφου επικοινωνίας και δείχνουμε ότι κάθε Peano κατηγόρημα που υπολογίζεται σταθερά από ένα πιθανοτικό MPP μπορεί να επαληθευτεί σε αιτιοκρατικό πολυωνυμικό χρόνο. / In this work we extend the population protocol model of Angluin et al., in order to model more powerful networks of very small resource limited artefacts (agents) that is possible to follow some unpredictable passive movement. These agents communicate in pairs according to the commands of an adversary scheduler. A directed (or undirected) communication graph encodes the following information: each edge (u,υ) denotes that during the computation it is possible for an interaction between u and υ to happen in which u is the initiator and υ the responder. The new characteristic of the proposed mediated population protocol model is the existance of a passive communication provider that we call mediator. The mediator is a simple database with communication capabilities. Its main purpose is to maintain the permissible interactions in communication classes, whose number is constant and independent of the population size. For this reason we assume that each agent has a unique identifier for whose existence the agent itself is not informed and thus cannot store it in its working memory. When two agents are about to interact they send their ids to the mediator. The mediator searches for that ordered pair in its database and if it exists in some communication class it sends back to the agents the state corresponding to that class. If this interaction is not permitted to the agents, or, in other words, if this specific pair does not exist in the database, the agents are informed to abord the interaction. Note that in this manner for the first time we obtain some control on the safety of the network and moreover the mediator provides us at any time with the network topology. Equivalently, we can model the mediator by communication links that are capable of keeping states from a edge state set of constant cardinality. This alternative way of thinking of the new model has many advantages concerning the formal modeling and the design of protocols, since it enables us to abstract away the implementation details of the mediator. Moreover, we extend further the new model by allowing the edges to keep readable only costs, whose values also belong to a constant size set. We then allow the protocol rules for pairwise interactions to modify the corresponding edge state by also taking into account the costs. Thus, our protocol descriptions are still independent of the population size and do not use agent ids, i.e. they preserve scalability, uniformity and anonymity. The proposed Mediated Population Protocols (MPP) can stably compute graph properties of the communication graph. We show this for the properties of maximal matchings (in undirected communication graphs), also for finding the transitive closure of directed graphs and for finding all edges of small cost. We demonstrate that our mediated protocols are stronger than the classical population protocols. First of all we notice an obvious fact: the classical model is a special case of the new model, that is, the new model can compute at least the same things with the classical one. We then present a mediated protocol that stably computes the product of two nonnegative integers in the case where G is complete directed and connected. Such kind of predicates are not semilinear and it has been proven that classical population protocols in complete graphs can compute precisely the semilinear predicates, thus in this manner we show that there is at least one predicate that our model computes and which the classical model cannot compute. To show this fact, we state and prove a general Theorem about the composition of two mediated population protocols, where the first one has stabilizing inputs. We also show that all predicates stably computable in our model are (non-uniformly) in the class NSPACE(m), where m is the number of edges of the communication graph. Finally, we define Randomized MPP and show that, any Peano predicate accepted by a Randomized MPP, can be verified in deterministic polynomial time.

In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for other problems involving languages. For example, the length of the shortest string accepted by a regular language provides a lower bound on the state complexity of the language. In Chapter 1, we introduce some relevant concepts and notation used in automata and language theory, and we show some basic results concerning the connection between the length of the shortest string and the nondeterministic state complexity of a regular language. Chapter 2 examines the effect of the intersection operation on the length of the shortest string in regular languages. A tight worst-case bound is given for the length of the shortest string in the intersection of two regular languages, and loose bounds are given for two variations on the problem. Chapter 3 discusses languages that are defined over a free group instead of a free monoid. We study the length of the shortest string in a regular language that becomes the empty string in the free group, and a variety of bounds are given for different cases. Chapter 4 mentions open problems and some interesting observations that were made while studying two of the problems: finding good bounds on the length of the shortest squarefree string accepted by a deterministic finite automaton, and finding an efficient way to check if a finite set of finite words generates the free monoid. Some of the results in this thesis have appeared in work that the author has participated in \cite{AngPigRamSha,AngShallit}.

Made available in DSpace on 2014-06-11T19:22:31Z (GMT). No. of bitstreams: 0 Previous issue date: 2009-10-30Bitstream added on 2014-06-13T20:09:43Z : No. of bitstreams: 1 almeida_ts_me_ilha.pdf: 5032122 bytes, checksum: ba20bdd1ce902754e7b772b2be3cc785 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Neste trabalho, apresenta-se o desenvolvimento e a avaliação de duas ferramentas que auxiliam projetos de circuitos eletrônicos, sejam eles projetos de sistemas digitais ou de sistemas mistos (sinais digitais e sinais analógicos). A partir de um diagrama de transição de estados, modelado em ambiente Stateflow®, a primeira ferramenta, denominada SF2HDL, realiza a extração de linguagens de descrição de hardware, podendo ser VHDL ou Verilog HDL. Sendo ainda capaz de extrair uma tabela de transição de estados padronizada, que, posteriormente, foi utilizada como entrada pelo programa TABELA, o qual realiza a minimização do sistema digital. A máquina de estados finitos, alvo da tradução, pode ser descrita tanto pelo modelo de Mealy como pelo modelo de Moore. Como estudos de caso, foram utilizados quatro códigos de linhas empregados em sistemas de telecomunicações. A segunda ferramenta é um aperfeiçoamento de uma ferramenta já existente, denominada MS2SV, empregada na síntese de sistemas mistos. O MS2SV é capaz de gerar uma descrição em VHDL-AMS estrutural, a partir de um modelo descrito em alto nível de abstração no ambiente Simulink®. Toda a estrutura de projeto necessária para a simulação e análise do sistema no ambiente SystemVision™, também é gerado pelo MS2SV. Foram utilizados quatro modelos de conversor de dados do tipo DAC (Digital to Analog Conversor), para avaliar o desempenho da ferramenta. Nesse contexto, as duas ferramentas permitem maior flexibilidade ao projetista, traduzindo descrições em níveis de abstração diferentes, o que permite uma análise mais detalhada do funcionamento do sistema e facilitando a sua implementação física / In this work, it’s shown the development and evaluation of two tools to aid in electronic circuits projects, be them digital systems projects or for mixed systems (digital and analogical signs). From a states transition diagram modeled in Stateflow® environment, the first tool, named SF2HDL, performs the extraction of hardware description languages, which could be VHDL or Verilog HDL. It is also capable of extracting states transition table standardized, which later was used as a TABELA program, which accomplishes the minimization of the digital system. The target finite state machine of the translated can be described by the Mealy model as much as the Moore model. As case studies were used four code lines employed in telecommunications systems. The second tool is an improvement of an already existent tool, known as MS2SV, used in the synthesis of mixed systems. The MS2SV is able to generate a description in structural VHDL-AMS, from a model described in high level of abstraction in the Simulink® environment. The whole project structure necessary for the simulation and analysis of the system by the SystemVision™ environment is also generated by MS2SV. Four DAC (Digital to Analog Converter) were used to evaluate the tool is performance. In that context, both tools allow a greater flexibility to the planner, translating descriptions in different abstraction levels, which allows a more detailed analysis of the systems behavior and making its physical implementation easier

A navegação autônoma é uma tarefa fundamental na robótica móvel. Para que esta tarefa seja realizada corretamente é necessário um sistema inteligente de controle e navegação associado ao sistema sensorial. Este projeto apresenta o desenvolvimento de um sistema de controle para a navegação de veículos e robôs móveis autônomos. A abordagem utilizada neste trabalho utiliza Redes Neurais Artificiais para o aprendizado de Autômatos Finitos de forma que os robôs possam lidar com os dados provenientes de seus sensores mesmo estando sujeitos a imprecisões e erros e ao mesmo tempo permite que sejam consideradas as diferentes situações e estados em que estes robôs se encontram (contexto). Dessa forma, é possível decidir como agir para realizar o controle da sua movimentação, e assim executar tarefas de controle e navegação das mais simples até as mais complexas e de alto nível. Portanto, esta dissertação visa utilizar Redes Neurais Artificiais para reconhecer o estado atual (contexto) do robô em relação ao ambiente em que está inserido. Uma vez que seja identificado seu estado, o que pode inclusive incluir a identificação de sua posição em relação aos elementos presentes no ambiente, o robô será capaz de decidir qual a ação/comportamento que deverá ser executado. O sistema de controle e navegação irá implementar um Autômato Finito que a partir de um estado atual define uma ação corrente, sendo capaz de identificar a mudança de estados, e assim alternar entre diferentes comportamentos previamente definidos. De modo a validar esta proposta, diversos experimentos foram realizados através do uso de um simulador robótico (Player-Stage), e através de testes realizados com robôs reais (Pioneer P3-AT, SRV-1 e veículos automatizados) / Autonomous navigation is a fundamental task in mobile robotics. In order to accurately perform this task it is necessary an intelligent navigation and control system associated to the sensorial system. This project presents the development of a control system for autonomous mobile robots and vehicles navigation. The adopted approach uses Artificial Neural Networks for Finite State Machine learning, allowing the robots to deal with sensorial data even when this data is not precise and correct. Simultaneously, it allows the robots to consider the different situations and states they are inserted in (context detection). This way, it is possible to decide how to proceed with motion control and then execute navigation and control tasks from the most simple ones until the most complex and high level tasks. So, this work uses Artificial Neural Networks to recognize the robots current state (context) at the environment where it is inserted. Once the state is detected, including identification of robots position according to environment elements, the robot will be able to determine the action/- behavior to be executed. The navigation and control system implements a Finite State Machine deciding the current action from current state, being able to identify state changes, alternating between different previously defined behaviors. In order to validade this approach, many experiments were performed with the use of a robotic simulator (Player-Stage), and carrying out tests with real robots (Pioneer P3-AT, SRV-1 and autonomous vehicles)

This thesis is about semiautomatic network protocol diagnostics and creating protocol description from eavesdropped communication. Several network eavesdropping techniques  and some common programs for network analysis are introduced. Well-known network protocols are described, with focus on their communication messages. Some already existing methods for creating models from examples are mentioned and their characteristics defined. Next we design architecture of developed tool and some methods, that create protocol description. After that we explain implementation of this tool and finally the tool is tested and experimented with.

Biological neural systems (BNS) in general and the central nervous system (CNS) specifically exhibit a strikingly efficient computational power along with an extreme flexible and adaptive basis for acquiring and integrating new knowledge. Acquiring more insights into the actual mechanisms of information processing within the BNS and their computational capabilities is a core objective of modern computer science, computational sciences and neuroscience. Among the main reasons of this tendency to understand the brain is to help in improving the quality of life of people suffer from loss (either partial or complete) of brain or spinal cord functions. Brain-computer-interfaces (BCI), neural prostheses and other similar approaches are potential solutions either to help these patients through therapy or to push the progress in rehabilitation. There is however a significant lack of knowledge regarding the basic information processing within the CNS. Without a better understanding of the fundamental operations or sequences leading to cognitive abilities, applications like BCI or neural prostheses will keep struggling to find a proper and systematic way to help patients in this regard. In order to have more insights into these basic information processing methods, this thesis presents an approach that makes a formal distinction between the essence of being intelligent (as for the brain) and the classical class of artificial intelligence, e.g. with expert systems. This approach investigates the underlying mechanisms allowing the CNS to be capable of performing a massive amount of computational tasks with a sustainable efficiency and flexibility. This is the essence of being intelligent, i.e. being able to learn, adapt and to invent. The approach used in the thesis at hands is based on the hypothesis that the brain or specifically a biological neural circuitry in the CNS is a dynamic system (network) that features emergent capabilities. These capabilities can be imported into spiking neural networks (SNN) by emulating the dynamic neural system. Emulating the dynamic system requires simulating both the inner workings of the system and the framework of performing the information processing tasks. Thus, this work comprises two main parts. The first part is concerned with introducing a proper and a novel dynamic synaptic model as a vital constitute of the inner workings of the dynamic neural system. This model represents a balanced integration between the needed biophysical details and being computationally inexpensive. Being a biophysical model is important to allow for the abilities of the target dynamic system to be inherited, and being simple is needed to allow for further implementation in large scale simulations and for hardware implementation in the future. Besides, the energy related aspects of synaptic dynamics are studied and linked to the behaviour of the networks seeking for stable states of activities. The second part of the thesis is consequently concerned with importing the processing framework of the dynamic system into the environment of SNN. This part of the study investigates the well established concept of binding by synchrony to solve the information binding problem and to proposes the concept of synchrony states within SNN. The concepts of computing with states are extended to investigate a computational model that is based on the finite-state machines and reservoir computing. Biological plausible validations of the introduced model and frameworks are performed. Results and discussions of these validations indicate that this study presents a significant advance on the way of empowering the knowledge about the mechanisms underpinning the computational power of CNS. Furthermore it shows a roadmap on how to adopt the biological computational capabilities in computation science in general and in biologically-inspired spiking neural networks in specific. Large scale simulations and the development of neuromorphic hardware are work-in-progress and future work. Among the applications of the introduced work are neural prostheses and bionic automation systems.

The goal of this diploma work is the suggestion and the implementation of the application, which allows adding / removing of diacritics into / from Czech written text. Retrieval "trie" structure is described along with its relation to finite state automata. Further, algorithm for minimization of finite state automata is described and various methods for adding diacritics are discussed. In practical part the implementation in Java programming language with usage of object-oriented approach is given. Achieved results are evaluated and analysed in the conclusion.

Two-dimensional scan design is an effective BIST architecture that uses multiple scan chains in parallel to test the Circuit Under Test (CUT). Linear Finite State Machines (LFSMs) are often used as on-board Pseudo Random Pattern Generators (PRPGs) in two-dimensional scan designs. However, linear dependencies present in the LFSM generated test-bit sequences adversely affect the resultant fault coverage in two-dimensional scan designs. In this work, we present methods that improve the resultant fault coverage in two-dimensional scan designs through the minimization of linear dependencies. Currently, metric of channel separation and matrix-based metric are used in order to estimate linear dependencies in a CUT. When the underlying sub-circuit (cone) structure of a CUT is available, the matrix-based metric can be used more effectively. Fisrt, we present two methods that use matrix-based metric and minimize the overall linear dependencies in a CUT through explicitly minimizing linear dependencies in the highest number of underlying cones of the CUT. The first method minimizes linear dependencies in a CUT through the selection of an appropriate LFSM structure. On the other hand, the second method synthesizes a phase shifter for a specified LFSM structure such that the overall linear dependencies in a CUT are minimized. However, the underlying structure of a CUT is not always available and in such cases the metric of channel separation can be used more effectively. The metric of channel separation is an empirical measure of linear dependencies and an ad-hoc large channel separation is imposed between the successive scan chains of a two-dimensional scan design in order to minimize the linear dependencies. Present techniques use LFSMs with additional phase shifters (LFSM/PS) as PRPGs in order to obtain desired levels of channel separation. We demonstrate that Generalized LFSRs (GLFSRs) are a better choice as PRPGs compared to LFSM/PS and obtain desired levels of channel separations at a lower hardware cost than the LFSM/PS. Experimental results corroborate the effectiveness of the proposed methods through increased levels of the resultant fault coverage in two-dimensional scan designs.

Huge amount of medical data has been generated in practical experiments which makes data analysis a challenging problem. This requires novel techniques to be developed. The improvements in computational power suggest to use computerbased modeling approaches to process a large set of data. One of the important systems in the human body to be investigated is the immune system. The previous studies of medical scientists and ongoing experiments at Karolinska Institute provide information about the human immune system. This information includes attributes of human immune system’s blood cells and the interactions between these cells. This interactions are provided as ‘if-then’ logical rules. Each rule verifies a condition on the attribute of one cell and it may initiate interaction processes to modify the attributes of other cells. A specific temporal value is associated to each process to quantify the speed of that process in the body (i.e., slow, medium, fast). We propose an agent-based model (ABM) to study human immune system cells and their interactions. The ABM is selected to overcome the complexity of large amount of data and find emergent properties and behavior patterns of the cells. Immune system cells are modeled as autonomous agents which have interactions with each other. Different values of a cell attributes define possible states of the cell and the collection of states of all cells constructs the state of the whole agent-based model. In order to consider the state transitions of the cells, we used a finite state machine (FSM). The first state is constructed from the input initial values for the cells and considering the logical time of 1. In each step, the program goes one time unit further and computes next state by applying the changes based on the cells’ interactions rules. This evolution of states in time is similar to game of life (GOL) automaton. The final model based on three modeling approaches of ABM, FSM and GOL are used to test medical hypothesis related to human immune system. This model provides a useful framework for medical scientists to do experiments on the cells’ attributes and their interaction rules. Considering a set of cells and their interactions, the proposed framework shows emergent properties and behavior patterns of the human immune system.

This paper presents a two-level morphological description of Tagalog for use in PC-Kimmo and a mechanism created for updating the results output from PC-Kimmo in order to meet the standards for current database and natural language processing applications. There are two main research tasks presented in this paper which constituted this project. First, a complete morphological engine for Tagalog is presented. Next, a tool is introduced that takes the morphological engine output and stores it in XML format.