Steffen Beyer > DFA-Kleene > DFA::Kleene

Download:
DFA-Kleene-1.0.tar.gz

Dependencies

Annotate this POD

View/Report Bugs
Module Version: 1.0   Source  

NAME ^

DFA::Kleene - Kleene's Algorithm for Deterministic Finite Automata

Calculates the "language" (set of words) accepted (= recognized) by a Deterministic Finite Automaton

See Math::Kleene(3) for the theory behind this algorithm!

SYNOPSIS ^

DESCRIPTION ^

The routines in this module allow you to define a Deterministic Finite Automaton and to compute the "language" (set of "words" or "patterns") accepted (= recognized) by it.

Actually, a list of regular expressions is generated which describe the same language (set of patterns) as the one accepted by your Deterministic Finite Automaton.

The output generated by this module can easily be modified to produce Perl-style regular expressions which can actually be used to recognize words (= patterns) contained in the language defined by your Deterministic Finite Automaton.

Other modules in this series (variants of Kleene's algorithm):

SEE ALSO ^

Math::MatrixBool(3), Math::MatrixReal(3), Math::Kleene(3), Set::IntegerRange(3), Set::IntegerFast(3), Bit::Vector(3).

VERSION ^

This man page documents "DFA::Kleene" version 1.0.

AUTHOR ^

Steffen Beyer <sb@sdm.de>.

COPYRIGHT ^

Copyright (c) 1996, 1997 by Steffen Beyer. All rights reserved.

LICENSE ^

This package is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

syntax highlighting: