Forlan Manual


Regular Expressions and Finite Automata

This subsection describes modules relating to regular expressions and finite automata. The Reg module defines the abstract type of regular expressions. The LP module defines the abstract type of labeled paths. The Tran module defines the concrete type of finite automata transitions, and the TranSet module provides operations on sets of transitions. The FA module defines the abstract type of finite automata, and the EFA, NFA and DFA modules define the abstract types of a series of increasingly more restrictive kinds of automata, the empty-string finite automata, nondeterministic finite automata, and deterministic finite automata, respectively. The TranReg module defines the concrete type of regular expression finite automata transitions, and the TranSet module provides operations on sets of regular expression finite automata transitions. Finally, the RFA module defines the abstract type of regular expression finite automata.

The Reg Module

The LP Module

The Tran Module

The TranSet Module

The FA Module

The EFA Module

The NFA Module

The DFA Module

The TranReg Module

The TranRegSet Module

The RFA Module


[ Top | Parent | Root | Contents | Index ]

Forlan Version 4.10
Copyright © 2018 Alley Stoughton