Pages that link to "Item:Q1111703"

The following pages link to On recognizable subsets of free partially commutative monoids (Q1111703):

Displaying 19 items.

• Recognizable subsets of the two letter plactic monoid (Q287233) (← links)
• Permutation rewriting and algorithmic verification (Q865624) (← links)
• On the decidability of some problems about rational subsets of free partially commutative monoids (Q1099641) (← links)
• Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
• Two recognizable string-matching problems over free partially commutative monoids (Q1190454) (← links)
• String matching problems over free partially commutative monoids (Q1207940) (← links)
• An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
• Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
• Recognizable subsets of semigroups (Q1345724) (← links)
• Recognizable subsets of some partially Abelian monoids (Q2266128) (← links)
• Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
• Overlaps in free partially commutative monoids (Q2639969) (← links)
• Shared-Memory Systems and Charts (Q3007636) (← links)
• (Q3489462) (← links)
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif (Q3734730) (← links)
• Parties reconnaissables de monoïdes définis par générateurs et relations (Q4032304) (← links)
• Computing the closure of sets of words under partial commutations (Q4645168) (← links)
• Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable (Q5096916) (← links)
• On free partially commutative monoids (Q5948073) (← links)