Congruences et automorphismes des automates finis

DOI10.1007/BF00289522zbMath0212.02803OpenAlexW2042602991MaRDI QIDQ2544412

Dominique Perrin, J. F. Perrot

Publication date: 1971

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (3)

Unnamed Item ⋮ Regular semigroups with D=R as syntactic monoids of prefix codes ⋮ Induced permutation automata and coverings of strongly connected automata

Cites Work

• Some results on the set of congruence relations in a finite, strongly connected automaton
• Corrigendum: `` The Automorphism Group of the Direct Product of Strongly Related Automata
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Automaton automorphisms
• On the group of automorphisms of strongly connected automata
• Endliche Gruppen I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Congruences et automorphismes des automates finis