Pages that link to "Item:Q391641"

The following pages link to Regular languages and partial commutations (Q391641):

Displaying 10 items.

• Some results of Zoltán Ésik on regular languages (Q1679953) (← links)
• Geometrically closed positive varieties of languages (Q2084767) (← links)
• Commutative regular languages with product-form minimal automata (Q2096583) (← links)
• The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
• State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
• Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
• Rational subsets and submonoids of wreath products. (Q2347806) (← links)
• The Shuffle Product: New Research Directions (Q2799163) (← links)
• State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
• State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)