Skip to main content

Regular Expressions and Automata using Miranda

Thompson, Simon (1995) Regular Expressions and Automata using Miranda. Other. UKC (Unpublished) (KAR id:21260)

Language: English
Download (155kB) Preview
Language: English
Download (312kB) Preview


In these notes Miranda is used as a vehicle to introduce regular expressions, pattern matching, and their implementations by means of non-deterministic and deterministic automata. As part of the material, we give an implementation of the ideas, contained in a set of files. References to this material are scattered through the text. The files can be obtained by following the instructions in medskip noindent tt medskip noindent This material is based on the treatment of the subject in `the Dragon book', but provides full implementations rather than their pseudo-code versions of the algorithms. The material gives an illustration of many of the features of Miranda, including polymorphism (the states of an NFA can be represented by objects of any type); modularisation (the system is split across a number of modules); higher-order functions (used in finding limits of processes, for example) and other features.

Item Type: Monograph (Other)
Uncontrolled keywords: regular expression, automata, sets, Miranda, functional programming
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 20 Aug 2009 19:01 UTC
Last Modified: 23 Jan 2020 04:04 UTC
Resource URI: (The current URI for this page, for reference purposes)
Thompson, Simon:
  • Depositors only (login required):


Downloads per month over past year