The following pages link to (Q4001349):
Displayed 50 items.
- \(Q\)-factorization of suffixes of two-way infinite extensions of irrational characteristic words (Q516819) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Decision problems for convex languages (Q553302) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- A note on prefix primitive words (Q611047) (← links)
- On group codes (Q671367) (← links)
- Completion of recognizable bifix codes (Q673111) (← links)
- Decompositions of recognizable strong maximal codes (Q685444) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Codes, orderings, and partial words (Q706621) (← links)
- Three-element codes with one \(d\)-primitive word (Q707501) (← links)
- Prefix-primitive annihilators of languages under some operations (Q715048) (← links)
- Some properties of the disjunctive languages contained in \(Q\) (Q766159) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Codes defined by multiple sets of trajectories (Q860886) (← links)
- Alternative proof of the Lyndon-Schützenberger theorem (Q860888) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- Marcus contextual languages consisting of primitive words (Q947806) (← links)
- Synchronization (Q948067) (← links)
- Periodicity properties on partial words (Q948072) (← links)
- On pseudoknot-bordered words and their properties (Q1004600) (← links)
- Regular autodense languages (Q1006340) (← links)
- Topology on words (Q1019711) (← links)
- On the Shyr-Yu theorem (Q1034608) (← links)
- Monoids with disjunctive identity and their codes (Q1091482) (← links)
- Automata accepting primitive words (Q1103732) (← links)
- Disjunctive splittability of languages (Q1105047) (← links)
- Relatively f-disjunctive languages (Q1105049) (← links)
- Languages whose \(n\)-element subsets are codes (Q1184989) (← links)
- Outfix and infix codes and related classes of languages (Q1186552) (← links)
- On the structure of some group codes (Q1188327) (← links)
- Unbordered factors of the characteristic sequences of irrational numbers (Q1275094) (← links)
- \(d\)-minimal languages (Q1281400) (← links)
- Scattered deletion and commutativity (Q1318700) (← links)
- Monogenic \(e\)-closed languages and dipolar words (Q1318822) (← links)
- Right \(k\)-dense languages (Q1322582) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes (Q1341748) (← links)
- On the robustness of primitive words (Q1348393) (← links)
- Congruences, infix and cohesive prefix codes (Q1349710) (← links)
- Slender 0L languages (Q1351458) (← links)
- Fuzzy language on free monoid (Q1364503) (← links)
- \(\alpha\)-words and factors of characteristic sequences (Q1377868) (← links)
- Free submonoids in the monoid of languages (Q1381858) (← links)
- The single loop representations of regular languages (Q1383380) (← links)
- Structure of 3-infix-outfix maximal codes. (Q1389661) (← links)
- Insertion and deletion closure of languages (Q1391134) (← links)
- A representation theorem of the suffixes of characteristic sequences (Q1392545) (← links)
- Combinatorial properties of codes with degree \(n\) (Q1395008) (← links)
- Coding properties of DNA languages. (Q1401178) (← links)