No label defined (Q3746906)

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 3982545
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3982545

      Statements

      0 references
      1986
      0 references
      Rational relations
      0 references
      finite transductions
      0 references
      containment hierarchy
      0 references
      complexity of canonical function computation
      0 references
      class membership decision problems
      0 references
      rational functions
      0 references
      subsequential functions
      0 references
      Hasse diagrams
      0 references
      [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.
      0 references

      Identifiers