Pages that link to "Item:Q5261608"

The following pages link to State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608):

Displaying 2 items.

• A pumping lemma for regular closure of prefix-free languages (Q2105458) (← links)
• Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)