Pages that link to "Item:Q4571944"
From MaRDI portal
The following pages link to Finite loops recognize exactly the regular open languages (Q4571944):
Displaying 5 items.
- Conservative groupoids recognize only regular languages (Q476161) (← links)
- Languages recognized by finite aperiodic groupoids (Q1274931) (← links)
- Language equations (Q2074222) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
