Pages that link to "Item:Q3451097"
From MaRDI portal
The following pages link to Complexity Analysis: Transformation Monoids of Finite Automata (Q3451097):
Displaying 10 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Characterization of idempotent transformation monoids (Q1119394) (← links)
- Green's relations in deterministic finite automata (Q2311884) (← links)
- Green's relations in finite transformation semigroups (Q2399369) (← links)
- Completely Reachable Automata (Q2829965) (← links)
- The intersection problem for finite monoids (Q3304129) (← links)
- The membership problem in aperiodic transformation monoids (Q4302805) (← links)
- The complexity of properties of transformation semigroups (Q4960463) (← links)
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123) (← links)
- Over Which Monoids is the Transducer Determinization Procedure Applicable? (Q5739012) (← links)