Book contents
- Frontmatter
- Contents
- Preface
- Part I Formal Background
- Part II From Theory to Practice
- 7 The C(M) language
- 8 C(M) Implementation of Finite-State Devices
- 9 The Aho–Corasick Algorithm
- 10 The Minimal Deterministic Finite-State Automaton for a Finite Language
- 11 Constructing Finite-State Devices for Text Rewriting
- References
- Index
8 - C(M) Implementation of Finite-State Devices
from Part II - From Theory to Practice
Published online by Cambridge University Press: 29 July 2019
- Frontmatter
- Contents
- Preface
- Part I Formal Background
- Part II From Theory to Practice
- 7 The C(M) language
- 8 C(M) Implementation of Finite-State Devices
- 9 The Aho–Corasick Algorithm
- 10 The Minimal Deterministic Finite-State Automaton for a Finite Language
- 11 Constructing Finite-State Devices for Text Rewriting
- References
- Index
Summary
In this chapter we present C(M) implementations of the main automata constructions. Our aim is to provide full descriptions of the implementations that are clear and easy to follow. In some cases the simplicity of the implementation is achieved at the expense of some inefficiency.
Keywords
- Type
- Chapter
- Information
- Finite-State TechniquesAutomata, Transducers and Bimachines, pp. 177 - 235Publisher: Cambridge University PressPrint publication year: 2019