Pages that link to "Item:Q391641"

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

Displaying 23 items.

• Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
• A note on the commutative closure of star-free languages (Q672729) (← links)
• Regular binoid expressions and regular binoid languages. (Q1401404) (← links)
• 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)
• Language theoretic properties of regular DAG languages (Q2272978) (← links)
• Rational subsets and submonoids of wreath products. (Q2347806) (← links)
• Relatively regular languages and thin codes (Q2462337) (← links)
• The Shuffle Product: New Research Directions (Q2799163) (← links)
• POWERS OF REGULAR LANGUAGES (Q3086241) (← links)
• Hairpin Lengthening and Shortening of Regular Languages (Q3166949) (← links)
• Efficiency of automata in semi-commutation verification techniques (Q3515458) (← links)
• Duality and Equational Theory of Regular Languages (Q3519505) (← links)
• Overlap-Free Regular Languages (Q3591303) (← links)
• (Q4407437) (← links)
• Partial Commutation on Array Languages (Q4912434) (← links)
• (Q5016365) (← 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)