Pages that link to "Item:Q1084189"
From MaRDI portal
The following pages link to On some equations in free partially commutative monoids (Q1084189):
Displaying 39 items.
- On a conjecture about finite fixed points of morphisms (Q557920) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Graphs and free partially commutative monoids (Q803150) (← links)
- Some properties of commutation in free partially commutative monoids (Q1068945) (← links)
- Mixed product and asynchronous automata (Q1099643) (← links)
- The word problem for free partially commutative groups (Q1109139) (← links)
- Théorèmes de transfert pour les polynômes partiellement commutatifs. (Transfer theorems for partially commutative polynomials) (Q1113985) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- Two recognizable string-matching problems over free partially commutative monoids (Q1190454) (← links)
- The free partially commutative Lie algebra: Bases and ranks (Q1199767) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- Commutativity in free inverse monoids (Q1275459) (← links)
- Lyndon traces and shuffle algebras (Q1334807) (← links)
- On the system of word equations \(x^ i_ 1 x^ i_ 2\dots x^ i_ m=y^ i_ 1 y^ i_ 2\dots y^ i_ n\) \((i=1,2,\dots)\) in a free monoid (Q1357811) (← links)
- The monoid of queue actions (Q1702520) (← links)
- The lattices of prefixes and overlaps of traces (Q1815323) (← links)
- Undecidability of the trace coding problem and some decidable cases (Q1884985) (← links)
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids (Q1901039) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- On the system of word equations \(x_{0} u^{i}_{1} x_{1} u^{i}_{2} x_{2} u^{i}_{3} x_{3}=y_{0} v^{i}_{1} y_{1} v^{i}_{2} y_{2} v^{i}_{3} y_{3}\) \((i=0,1,2,\ldots)\) in a free monoid (Q1960659) (← links)
- The power word problem in graph products (Q2164009) (← links)
- Free partially commutative structures (Q2365770) (← links)
- Equations over free inverse monoids with idempotent variables (Q2411041) (← links)
- Theorems on equalization and monomiality in a relatively free Grassmann algebra. (Q2451725) (← links)
- Overlaps in free partially commutative monoids (Q2639969) (← links)
- Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
- (Q3489462) (← links)
- (Q4221612) (← links)
- Solving trace equations using lexicographical normal forms (Q4571965) (← links)
- Finite parametrization of solutions of equations in a free monoid. I (Q4658289) (← links)
- On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
- Pattern matching in trace monoids (Q5048955) (← links)
- Semi-trace morphisms and rational transductions (Q5096739) (← links)
- One-rule trace-rewriting systems and confluence (Q5096864) (← links)
- Some Pexider-type generalizations of the symmetrized multiplicative functional equation on monoids (Q5231873) (← links)
- Logspace computations in graph products (Q5925209) (← links)
- On free partially commutative monoids (Q5948073) (← links)
- The power word problem in graph products (Q6580077) (← links)
