Some results on the decomposition of finite automata

DOI10.1016/S0019-9958(78)90084-0zbMath0419.68087MaRDI QIDQ3853136

Jerzy Tiuryn

Publication date: 1978

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

connection graphiterative decompositionconnected automataendomorphism semigroup of a finite automatonrealization by iterative networks

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Cellular automata (computational aspects) (68Q80) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

The complexity of computing the automorphism group of automata and related problems

This page was built for publication: Some results on the decomposition of finite automata