Generated: August 27, 2003, 22:48:22 | Copyright ©2003, Kurt Nørmark | ![]() |
Master index
Source file: lib/final-state-automaton.scm
LAML Version 21.00 (August 27, 2003, PP edition)
|
|
|
1. AUTOMATON CONSTRUCTION AND SELECTION.
make-finite-state-automaton
Form |
|
Description |
|
Parameters |
|
Returns |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
2. STATE AND TRANSITION PREDICATES.
state-equal?
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
3. TRANSITIONS
make-automaton-transition
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
Form |
|
Description |
|
4. ACCEPTANCE PREDICATE.
automaton-accepts?
Form |
|
Description |
|
5. DFA CONSTRUCTION FROM NFA.
Construction of deterministic final automaton af non-deterministic final state automaton.
subset-construction
Form |
|
Description |
|
Parameters |
|