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

DOI10.1007/BF02235812zbMath0166.26904OpenAlexW1966175226MaRDI QIDQ2529970

P. Deussen

Publication date: 1967

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02235812

zbMATH Keywords

languages, automata, networks

Related Items (4)

On the endomorphisms of finite automata ⋮ A characterization of automata and a direct product decomposition ⋮ Congruences et automorphismes des automates finis ⋮ A structure theory of automata characterized by groups

Cites Work

• Unnamed Item
• Unnamed Item
• On the Structures of an Automaton and Its Input Semigroup
• Isomorphism Groups of Automata

This page was built for publication: Some results on the set of congruence relations in a finite, strongly connected automaton