Book contents
- Frontmatter
- Contents
- Preface
- Part I Formal Background
- 1 Formal Preliminaries
- 2 Monoidal Finite-State Automata
- 3 Classical Finite-State Automata and Regular Languages
- 4 Monoidal Multi-Tape Automata and Finite-State Transducers
- 5 Deterministic Transducers
- 6 Bimachines
- Part II From Theory to Practice
- References
- Index
1 - Formal Preliminaries
from Part I - Formal Background
Published online by Cambridge University Press: 29 July 2019
- Frontmatter
- Contents
- Preface
- Part I Formal Background
- 1 Formal Preliminaries
- 2 Monoidal Finite-State Automata
- 3 Classical Finite-State Automata and Regular Languages
- 4 Monoidal Multi-Tape Automata and Finite-State Transducers
- 5 Deterministic Transducers
- 6 Bimachines
- Part II From Theory to Practice
- References
- Index
Summary
The aim of this chapter is twofold. First, we recall a collection of basic mathematical notions that are needed for the discussions of the following chapters. Second, we have a first, still purely mathematical, look at the central topics of the book: languages, relations and functions between strings, as well as important operations on languages, relations and functions. We also introduce monoids, a class of algebraic structures that gives an abstract view on strings, languages, and relations.
Keywords
- Type
- Chapter
- Information
- Finite-State TechniquesAutomata, Transducers and Bimachines, pp. 3 - 22Publisher: Cambridge University PressPrint publication year: 2019