The following pages link to Hae-Sung Eom (Q392178):
Displaying 8 items.
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- State Complexity of Basic Operations on Non-returning Regular Languages (Q2843084) (← links)
- State Complexity of Subtree-Free Regular Tree Languages (Q2843085) (← links)
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages (Q2843086) (← links)
- State Complexity of Basic Operations on Non-Returning Regular Languages (Q2968533) (← links)
- State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)
