Pages that link to "Item:Q1111703"

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

Displaying 11 items.

• Permutation rewriting and algorithmic verification (Q865624) (← 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)
• Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
• Shared-Memory Systems and Charts (Q3007636) (← 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)