Pages that link to "Item:Q2512830"
From MaRDI portal
The following pages link to On the index of Simon's congruence for piecewise testability (Q2512830):
Displaying 18 items.
- Relations on words (Q505060) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Normal forms under Simon's congruence (Q667852) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- On Simon's congruence closure of a string (Q2112187) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Absent subsequences in words (Q2695493) (← links)
- On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116) (← links)
- (Q5005165) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- (Q5376657) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- On Simon's congruence closure of a string (Q6093575) (← links)
- On the 2-binomial complexity of the generalized Thue-Morse words (Q6138835) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
