The following pages link to (Q4001349):
Displayed 50 items.
- Shuffle and scattered deletion closure of languages (Q1575737) (← links)
- A characterization of local regular languages (Q1584215) (← links)
- Error-detecting properties of languages (Q1605317) (← links)
- Some results in \(r\)-disjunctive languages and related topics (Q1701724) (← links)
- Transducer descriptions of DNA code properties and undecidability of antimorphic problems (Q1706156) (← links)
- Codes induced by alternative codes (Q1752957) (← links)
- Language equations, maximality and error-detection (Q1765227) (← links)
- Is independence an exception? (Q1805264) (← links)
- The disjunctivities of \(\omega\)-languages. (Q1811081) (← links)
- Disjunctive decomposition of languages (Q1822508) (← links)
- Anti-commutative languages and n-codes (Q1823000) (← links)
- Regular component decomposition of regular languages. (Q1874420) (← links)
- Disjunctive languages related to \(p\)-primitive words (Q1935452) (← links)
- Grammatical complexity of one-dimensional maps with multiple monotone intervals (Q1961622) (← links)
- Remarks on external contextual grammars with selection (Q1998866) (← links)
- Borderedness-preserving homomorphisms (Q2015145) (← links)
- Some combinatorial properties of solid codes (Q2065362) (← links)
- A survey on computationally complete accepting and generating networks of evolutionary processors (Q2104129) (← links)
- On the complexity of decision problems for counter machines with applications to coding theory (Q2163996) (← links)
- Automata for solid codes (Q2235761) (← links)
- Block reversal on finite words (Q2243589) (← links)
- Some operations preserving primitivity of words (Q2271430) (← links)
- The ordinal generated by an ordinal grammar is computable (Q2326394) (← links)
- Bond-free DNA language classes (Q2461298) (← links)
- Solid codes and the uniform density of fd-domains. (Q2461500) (← links)
- Relatively regular languages and thin codes (Q2462337) (← links)
- Primitive partial words (Q2486065) (← links)
- Dependences related to strict binary relations (Q2576879) (← links)
- The syntactic monoid of hairpin-free languages (Q2641875) (← links)
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates (Q2672245) (← links)
- Implementation of Code Properties via Transducers (Q2830220) (← links)
- Some properties of involution codes (Q2895974) (← links)
- FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION (Q2909182) (← links)
- A note of involutively bordered words (Q3002343) (← links)
- A note of solutions to the morphic involution language equations (Q3005870) (← links)
- Sub-classes of the monoid of left cancellative languages (Q3008369) (← links)
- Semigroups with<i>I</i>-Quasi Length and Syntactic Semigroups (Q3015087) (← links)
- Classifications of bifix codes (Q3056399) (← links)
- INVOLUTIVELY BORDERED WORDS (Q3065618) (← links)
- PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS (Q3086250) (← links)
- Solutions to the involution language equation (Q3101624) (← links)
- 𝒫𝒮-regular languages (Q3101635) (← links)
- Annihilators of bifix codes (Q3375529) (← links)
- δ-codes and δ-languages (Q3379147) (← links)
- Generalized periodicity and primitivity for words (Q3423154) (← links)
- Dense property of initial literal shuffles (Q3477983) (← links)
- Uniformly bounded duplication codes (Q3512596) (← links)
- WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID (Q3542877) (← links)
- Equations on partial words (Q3549287) (← links)
- Semaphore Codes and Ideals (Q3790667) (← links)