Pages that link to "Item:Q2909103"
From MaRDI portal
The following pages link to STATE COMPLEXITY OF CODE OPERATORS (Q2909103):
Displaying 4 items.
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- Groups and semigroups defined by colorings of synchronizing automata (Q2934265) (← links)
- On the decidability of infix inclusion problem (Q6580072) (← links)
