# Construction of finite automata from examples

## Supervisor

## Suitable for

## Abstract

**Description:** The aim of the project is to allow a user to construct a finite automaton (or alternatively,
a regular expression) by providing examples of strings that ought to be accepted by it, in addition to examples that ought
not to be accepted. An initial approach would be to test simple finite automata against the strings provided by the user;
more sophisticated approaches could be tried out subsequently. One possibility would be to implement an algorithm proposed
in a well-known paper by Angluin, "Learning regular sets from queries and counterexamples".

**Prerequisites:** competance and enthusiasm for program design and implementation; familiarity with finite
automata, context-free langauges etc.; mathematical proofs.