Abstract
The notion of balance of two morphisms on a given language is generalized to deal with the whole family of rational transductions. The usefulness of balance for proving decidability of equivalence of rational transductions is established. In particular, an alternative proof for a result of Culik showing the decidability of the equivalence problem of single-valued rational transductions on regular languages is given. In addition, a new result showing the decidability of the equivalence problem of inverses of single-valued rational transductions on regular languages is obtained.
| Original language | English |
|---|---|
| Pages (from-to) | 247-262 |
| Number of pages | 16 |
| Journal | Theoretical Computer Science |
| Volume | 47 |
| Issue number | C |
| DOIs | |
| State | Published - 1986 |