Skip to main content Accessibility help
  • Print publication year: 2019
  • Online publication date: July 2019

6 - Bimachines

from Part I - Formal Background


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.