Balance of many-valued transductions and equivalence problems (Q1095671)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4028932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Balance of many-valued transductions and equivalence problems |
scientific article; zbMATH DE number 4028932 |
Statements
Balance of many-valued transductions and equivalence problems (English)
0 references
1986
0 references
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.
0 references
balance of two morphisms
0 references
rational transductions
0 references
equivalence
0 references
regular languages
0 references
0 references
0 references
0 references
0 references
0 references
0.86416453
0 references
0.8624443
0 references
0.86088336
0 references
0.86084986
0 references
0.85872453
0 references
0.8585297
0 references
