An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

Details An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

2008-12-18

arxiv.org/abs/0812.3499v1

Mathematics

Group Theory

Scientific paper

The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the Prime Decomposition Theorem of K. Krohn and J. Rhodes, \textit{Algebraic theory of machines, {I}: {P}rime decomposition theorem for finite semigroups and machines}, Transactions of the American Mathematical Society \textbf{116} (1965), 450--464. Here we provide an effective lower bound for group complexity.

Affiliated with

Also associated with

No associations

Rating

An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-173039