Pages that link to "Item:Q5462123"
From MaRDI portal
The following pages link to STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123):
Displaying 14 items.
- On the size of inverse semigroups given by generators (Q627176) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- State transitions as morphisms for complete lattices (Q1586453) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Combination of roots and Boolean operations: an application to state complexity (Q2105451) (← links)
- Syntactic complexity of bifix-free regular languages (Q2319913) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- Syntactic complexity of bifix-free languages (Q2399256) (← links)
- Complexity Analysis: Transformation Monoids of Finite Automata (Q3451097) (← links)
- (Q5020521) (← links)
- (Q5130744) (← links)
- Implementation and Application of Automata (Q5463982) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
- Kleene theorems for lasso languages and \(\omega \)-languages (Q6636074) (← links)