The following pages link to (Q4430300):
Displaying 50 items.
- On del-robust primitive words (Q277635) (← links)
- On some factorizations of infinite words by elements of codes (Q287095) (← links)
- Noncommutative minimization algorithms (Q287255) (← links)
- Primitive morphisms (Q293147) (← links)
- On syntactic nuclei of rational languages (Q293361) (← links)
- Maximal dinucleotide and trinucleotide circular codes (Q304726) (← links)
- Dinucleotide circular codes (Q355961) (← links)
- A classification of 20-trinucleotide circular codes (Q418150) (← links)
- Weakly unambiguous morphisms (Q442106) (← links)
- Picture codes and deciphering delay (Q515672) (← links)
- On unambiguous reductions of monoids of unambiguous relations (Q581549) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- Construction of minimal deterministic finite automata from biological motifs (Q627199) (← links)
- Codes, simplifying words, and open set condition (Q671261) (← links)
- A three-word code which is not prefix-suffix composed (Q671357) (← links)
- On group codes (Q671367) (← links)
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Polyomino tilings, cellular automata and codicity (Q672463) (← links)
- Completion of recognizable bifix codes (Q673111) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- Decompositions of recognizable strong maximal codes (Q685444) (← links)
- Groups of finite elementary codes (Q685448) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- The operation \(\uparrow\) on formal power series (Q688677) (← links)
- Border correlation of binary words (Q703695) (← links)
- Codes, orderings, and partial words (Q706621) (← links)
- On the number of episturmian palindromes (Q708221) (← links)
- A generalized palindromization map in free monoids (Q714817) (← links)
- On the number of frames in binary words (Q719267) (← links)
- Pseudo-cyclic renewal systems (Q719279) (← links)
- On Christoffel and standard words and their derivatives (Q728275) (← links)
- The entropies and periods of renewal systems (Q731352) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Completing codes in a sofic shift (Q732037) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- An algorithm for testing permutativeness of cellular automata (Q732363) (← links)
- Prefix-free languages as \(\omega\)-generators (Q751290) (← links)
- An undecidable problem about rational sets and contour words of polyominoes (Q751298) (← links)
- The zig-zag power series: A two-way version of the \({}^*\) operator. (Q753497) (← links)
- On completion of codes with finite deciphering delay (Q757324) (← links)
- The applications of solid codes to r-R and r-D languages (Q780100) (← links)
- Completing biprefix codes (Q790624) (← links)
- The boxes (Q805238) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Extended automata-like regular expressions of star degree at most (2,1) (Q808718) (← links)
- On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups (Q818114) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Remarks on arbitrary multiple pattern interpretations (Q845932) (← links)
- Farey codes and languages (Q854840) (← links)
