The following pages link to (Q4430300):
Displaying 50 items.
- An algorithmic approach to the problem of a semiretract base (Q861270) (← links)
- Coding with variable block maps (Q861282) (← links)
- On the dynamics of cellular automata induced from a prefix code (Q865286) (← links)
- On codes defined by bio-operations (Q884441) (← links)
- Factorization forests of finite height (Q908712) (← links)
- Codes and local constraints (Q908715) (← links)
- Factorizations of free monoids and unavoidable regularities (Q910247) (← links)
- Parallel complexity of the regular code problem (Q913513) (← links)
- Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability) (Q914396) (← links)
- New optimization models for designing synchronizing codes (Q922437) (← links)
- A 2006 review of circular codes in genes (Q929164) (← links)
- A relation between trinucleotide comma-free codes and trinucleotide circular codes (Q935138) (← links)
- Synchronization (Q948067) (← links)
- Transducers for the bidirectional decoding of prefix codes (Q964396) (← links)
- Codes and maximal monoids (Q964399) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- On a zeta function associated with automata and codes (Q995583) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- Unbordered partial words (Q1028413) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- Cyclic renewal systems (Q1029338) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Compositions of maximal codes (Q1041240) (← links)
- On three-element codes (Q1063421) (← links)
- Groups in the syntactic monoid of a composed code (Q1081706) (← links)
- A property of three-element codes (Q1083216) (← links)
- Noncommutative factorization of variable-length codes (Q1094145) (← links)
- Mathematical optimization and the synchronizing properties of encodings (Q1101414) (← links)
- Finite biprefix sets of paths in a graph (Q1105386) (← links)
- Codes circulaires, automates locaux et entropie (Q1106180) (← links)
- An answer to a question about finite maximal prefix sets of words (Q1107641) (← links)
- A defect property of codes with unbounded delays (Q1113876) (← links)
- Counting with rational functions (Q1115616) (← links)
- On synchronizing unambiguous automata (Q1116340) (← links)
- Construction of a family of finite maximal codes (Q1117704) (← links)
- Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups) (Q1118045) (← links)
- Deciding the immutability of regular codes and languages under finite transduction (Q1120291) (← links)
- About prefix sets of words (Q1122006) (← links)
- A necessary condition for the rationality of the zeta function of a regular language (Q1122359) (← links)
- The meet operation in the lattice of codes (Q1127316) (← links)
- Maximal codes with bounded deciphering delay (Q1177932) (← links)
- Finite codes and groupoid words (Q1178037) (← links)
- Bounded delay L codes (Q1178694) (← links)
- Languages whose \(n\)-element subsets are codes (Q1184989) (← links)
- Outfix and infix codes and related classes of languages (Q1186552) (← links)
- A note on renewal systems (Q1190482) (← links)
- On the rank of the subsets of a free monoid (Q1193899) (← links)
- Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
- The free partially commutative Lie algebra: Bases and ranks (Q1199767) (← links)
- Stability for the zigzag submonoids (Q1208713) (← links)
