Yet another proof of the cascade decomposition theorem for finite automata

DOI10.1007/BF01703821zbMATH Open0164.32302OpenAlexW2055549480MaRDI QIDQ5549064FDOQ5549064

Authors: Paul Zeiger 

Publication date: 1967

Published in: Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

languages, automata, networks

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

Cited In (7)

• Some results on finite semigroups
• Remarks on algebraic decomposition of automata
• On the Krohn-Rhodes cascaded decomposition theorem
• On the accepting state complexity of operations on permutation automata
• Pointlike sets for varieties determined by groups
• On the accepting state complexity of operations on permutation automata
• On the Wilson monoid of a pairwise balanced design

This page was built for publication: Yet another proof of the cascade decomposition theorem for finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5549064)