Pages that link to "Item:Q2358683"
From MaRDI portal
The following pages link to State complexity of permutation on finite languages over a binary alphabet (Q2358683):
Displaying 7 items.
- On Simon's congruence closure of a string (Q2112187) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- (Q5092323) (← links)
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- (Q6070603) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- On Simon's congruence closure of a string (Q6093575) (← links)