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
6 - Bimachines
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
In this chapter we introduce the bimachine, a deterministic finite-state device that exactly represents the class of all regular string functions. We prove this correspondence, using as a key ingredient a procedure for converting transducers to bimachines. Methods for pseudo-minimization and direct composition of bimachines are added.
Keywords
- Type
- Chapter
- Information
- Finite-State TechniquesAutomata, Transducers and Bimachines, pp. 138 - 158Publisher: Cambridge University PressPrint publication year: 2019