scientific article; zbMATH DE number 3982545
[For the entire collection see Zbl 0587.00019.] Rational relations (finite transductions) which are equivalence relations are discussed. After establishing a containment hierarchy, the complexity of canonical function computation and a number of class membership decision problems are studied. The following classes are considered: (1) Rational equivalence relations, (2) Equivalence kernels of rational functions, (3) Deterministic rational equivalence relations, (4) Equivalence kernels of subsequential functions, (5) Recognizable equivalence relations, (6) Length-bounded rational equivalence relations, and (7) Finite equivalence relations. Except for one open case \(((1)=(2)?)\), Hasse diagrams are given to show the relative containments in the general and one-letter-alphabet cases. Canonical function application for an input of length n is shown to be \(O(n^ 2)\) time and space for (1), O(n) time and space for (2), (3), and (6), and O(n) time and constant space for the others. It is shown that transitivity, symmetry, reflexivity, and membership in any of (1) through (5) are undecidable properties for rational relations whereas membership in (6) or (7) is decidable.
- Rational equivalence relations
- Separating strings with small automata
- Canonical equivalence relations on \(\mathbb Q^n\)
- Finite transducers and rational transductions
- Partitioning a symmetric rational relation into two asymmetric rational relations
- Rational equivalence of cusps
- Rational selecting relations and selectors
- Equivalence Relations, Invariants, and Normal Forms
- scientific article; zbMATH DE number 3911744 (Why is no real title available?)
- Distances between languages and reflexivity of relations
- scientific article; zbMATH DE number 2107585 (Why is no real title available?)
- Separating words with machines and groups
- A combinatorial study of k-valued rational relations
- Maximal r.e. equivalence relations
- Identities and transductions
- An explicit algorithm for normal forms in small overlap monoids
- Separating words problem over groups
- Complexity classes of equivalence problems revisited
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746906)