FSA for streams

This is a library for running Finite State Automata (FSA) on bound and unbound streams of event.

It supports

• non-determininistic FSA’s,
• noise-tolerant FSA’s (i.e. ignoring some or all non-relevant events),
• overlapping matched,
• extensible matching functions for transitions.

It is available at https://github.com/pchampin/fsa4streams .

Contents

• Introduction
  • Bits and pieces
• FSA Description
  • Automata
  • State
  • Transition
  • Example
• Developers’ documentation
  • Module fsa
  • Module state
  • Module matcher

Indices and tables

• Index
• Module Index
• Search Page

Todo

Explain somewhere how to write additional matcher functions, and how they may be used to extend the expressiveness of FSA beyond regular grammars...