Talks & Seminars
Title: Effective Eilenberg Machines
Mr. Benoit Razet, INRIA France
Date & Time: January 15, 2009 15:00
Venue: Conference Room, 01st floor, ‘C’ Block, Kanwal Rekhi (KReSIT) Bldg.
Automata theory has been developed to overcome both theoretical and practical problems. Nowadays, automata are considered as basic knowledge, and they appear in most softwares. In 1974, Samuel Eilenberg introduced a machine model unifying the most common automata such as transducers, pushdown automata and even Turing machines. Eilenberg machines also have an interesting modularity property that leads to important issues concerning applications, which are defined as different levels of automata; as it may appear in computational linguistics. We propose an effective design of Eilenberg machines studying simulation techniques. Our simulator is defined by a functional program that progressively enumerates solutions, exploring a research space following several kind of strategies. The specification of the simulator can be stated formally in a proof assistant such as Coq. This work has been developed as joint research with Gérard Huet.
Speaker Profile:
Benoit Razet is a PhD Scholar in INRIA, Paris with research interest in Automata Theory and Language Processing. More details about him are available at http://pauillac.inria.fr/~razet/.
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback