Section outline

  • June 15

    Finite automata over infinite alphabets

    I. E. Mens, Department of Mathematics, Aristotle University of Thessaloniki, Greece


    Reasoning on infinite state systems with finite control and infinite data, requires new automata models working over infinite alphabets. We introduce here such a model, named variable finite automaton on words over infinite alphabets (VFA). This model is based on an underlying non-deterministic finite automaton over a finite alphabet containing variable symbols. The underlying automaton computes its language, and then replaces the variable symbols with symbols from the infinite alphabet following certain rules. We show that the class of recognizable languages over infinite alphabets is closed under union and intersection but not under complementation. The emptiness, equality and universality problems are decidable.

    A Conceptual SOA-based Framework for e-Government Central Database

    Dr. Rebhi Baraka, Head of Software Development Department, Faculty of Information Technology, Islamic University of Gaza


    The Central Database is one of the core components in the e-Government technical framework. In this talk we shed some light on the current situation of the Central Database and its limitations. The talk will present a proposed Service Oriented Architecture (SOA) framework that integrates with the concept of Enterprise Service Bus (ESB) and Web services. The proposed conceptual framework will enhance interoperability, flexibility and manageability of the Central Database in the e-Government.

    inite automata over infinite alphabets