An earlier paper characterized all subdirectly irreducible permutational fibered automata. This paper characterizes all subdirectly irreducible fibered automata which are not permutational. The characterization is both graphtheoretical and algebraic.
Contents
-
Open AccessSubdirectly irreducible fibered automata, Part 2May 10, 2017
-
May 10, 2017
-
May 10, 2017
-
May 10, 2017
-
May 10, 2017
-
May 10, 2017
-
May 10, 2017
-
Open AccessThe fuzzy basis of the sequence space ℓP(ℱ)May 10, 2017
-
May 10, 2017
-
May 10, 2017
-
May 10, 2017
-
Open AccessMixing operators on spaces with weak topologyMay 10, 2017
-
May 10, 2017
-
May 10, 2017
-
May 10, 2017