Pages that link to "Item:Q2909103"
From MaRDI portal
The following pages link to State complexity of code operators (Q2909103):
Displaying 8 items.
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- State Complexity of Deletion (Q2921973) (← links)
- Groups and semigroups defined by colorings of synchronizing automata (Q2934265) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- (Q5146522) (← links)
- Operational State Complexity under Parikh Equivalence (Q5496197) (← links)
- On the decidability of infix inclusion problem (Q6580072) (← links)