Pages that link to "Item:Q1775550"
From MaRDI portal
The following pages link to Finite automata and pattern avoidance in words (Q1775550):
Displaying 22 items.
- Locally convex words and permutations (Q281597) (← links)
- Pattern avoidance in poset permutations (Q304187) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Words avoiding a reflexive acyclic relation (Q813446) (← links)
- Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
- Finite automata for languages of combinatorial interest: An order theoretical point of view (Q1823003) (← links)
- Words restricted by patterns with at most 2 distinct letters (Q1856065) (← links)
- Locally restricted compositions over a finite group (Q2048360) (← links)
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations (Q2077272) (← links)
- Increasing consecutive patterns in words (Q2304195) (← links)
- Strongly restricted permutations and tiling with fences (Q2348057) (← links)
- Pattern avoidance in ordered set partitions and words (Q2406542) (← links)
- Extensions of the linear bound in the Füredi-Hajnal conjecture (Q2643869) (← links)
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
- Stack-sorting for Words (Q3300688) (← links)
- On avoidance of patterns of the form {\sigma}-{\tau} by words over a finite alphabet (Q3455038) (← links)
- On avoiding 1233 (Q5045252) (← links)
- Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations (Q5107065) (← links)
- (Q5197595) (← links)
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences (Q6170819) (← links)
- Words over a finite alphabet avoiding 1243 (Q6618737) (← links)
