Some results on the set of congruence relations in a finite, strongly connected automaton (Q2529970)

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 3266643
Language Label Description Also known as
default for all languages
No label defined
    English
    Some results on the set of congruence relations in a finite, strongly connected automaton
    scientific article; zbMATH DE number 3266643

      Statements

      Some results on the set of congruence relations in a finite, strongly connected automaton (English)
      0 references
      0 references
      0 references
      1967
      0 references
      languages, automata, networks
      0 references
      lattice of congruence relations
      0 references
      strongly connected right regular automata
      0 references
      lattice of subgroups
      0 references
      automorphism group
      0 references
      It is well known that the lattice of all congruence relations of a finite automaton is an important construct. This paper studies some relations between this lattice and the lattice of subgroups of the automorphism group of the automata using the obvious Galois connection. Most of the discussion and results concerns strongly connected right regular automata. The general case is much harder.
      0 references

      Identifiers