Skip to search formSkip to main contentSkip to account menu

Krohn–Rhodes theory

Known as: Krohn, Finite semigroup, Krohn-Rhodes complexity 
In mathematics and computer science, the Krohn–Rhodes theory (or algebraic automata theory) is an approach to the study of finite semigroups and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
AlgorithmArtificial intelligenceAutomata theoryCIAA (formerly WIA)

Broader (1)

Category theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Improved efficiency measures through directional distance formulation of data envelopment analysis
This paper develops a model for an improved efficiency measure through directional distance formulation of data envelopment… 
2012
2012
Examining the Link Between Being a Victim of Bullying and Delinquency Trajectories Among an African American Sample
The purpose of the present study is to provide an analysis of the link between being a victim of bullying and delinquency… 
Highly Cited
2006
Highly Cited
2006
Intuitionistic fuzzy finite switchboard state machines
The notion of intuitionistic fuzzy finite switchboard state machines and (strong) homomorphisms of intuitionistic fuzzy finite… 
2002
2002
Comparing Semigroup and Monoid Presentations for Finite Monoids
Abstract. It is known that for any finite group G given by a finite group presentation there exists a finite semigroup… 
1997
1997
A Mathematical Introduction to String Theory: Variational Problems, Geometric and Probabilistic Methods (London Mathematical Society Lecture Note Series 225)
1997
1997
VULCANS AND JUTES: CUBAN FRATERNITIES AND THEIR DISAPPEARANCE
Formation of gangs usually has involved two themes: lack of opportunities for youth and cultural context of youths' activities… 
1992
1992
Recursive Interaction and the Dynamics of Knowledge Production in Research Groups: An Empirical Simulation of Knowledge Production
The last 10 years have seen a change in the study of the processes of scientific knowledge production in research on science:1… 
1991
1991
Embedding finite semigroup amalgams
Abstract Let S, T1,… Tk be finite semigroups and Ψ: S → Ti, be embeddings. When C[S] is semisimple, we find necessary and… 
1968
1968
A NEW SPECIES OF EUKROHNIA FROM THE INDIAN SEAS WITH NOTES ON THREE OTHER SPECIES OF CHAETOGNATHA
Berween 1963 and 1966 during the research cruises of R.V. Varuna off the west coast of India and the Laccadive Sea, the Indian… 
1966
1966
On maximal congruences and finite semisimple semigroups
A right congruence p of a semigroup S is called modular if there is an element e of S such that eapa for all a in S. The element… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)