The following pages link to (Q3714479):
Displaying 50 items.
- Conjugacy relations of prefix codes (Q287447) (← links)
- Permutation cellular automata (Q368686) (← links)
- Extremal minimality conditions on automata (Q441884) (← links)
- Some properties of involution binary relations (Q493117) (← links)
- Fixed points of endomorphisms over special confluent rewriting systems. (Q604812) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- Strong trinucleotide circular codes (Q666521) (← links)
- Prefix-primitive annihilators of languages under some operations (Q715048) (← links)
- A genetic scale of reading frame coding (Q890678) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- f-disjunctive congruences and a generalization of monoids with length (Q915873) (← links)
- Palindromic richness (Q1003605) (← links)
- Infinite-vertex free profinite semigroupoids and symbolic dynamics. (Q1004467) (← links)
- A stochastic model of gene evolution with time dependent pseudochaotic mutations (Q1026625) (← links)
- On varieties of rational languages and variable length codes. II (Q1079669) (← links)
- Monoids with disjunctive identity and their codes (Q1091482) (← links)
- On generators of rational \(\omega\)-power languages (Q1095674) (← links)
- A note on r-extensible prefix codes (Q1114025) (← links)
- Strongly compatible total orders on free monoids (Q1179490) (← links)
- On the structure of some group codes (Q1188327) (← links)
- The entropies of renewal systems (Q1191991) (← links)
- Limited semaphore codes (Q1204129) (← links)
- Uniformly synchronous limited codes (Q1206775) (← links)
- Uniformly synchronous codes (Q1209281) (← links)
- Non literal transducers and some problems of normality (Q1320517) (← links)
- Right \(k\)-dense languages (Q1322582) (← links)
- On the degree of finite maximal biprefix codes (Q1322583) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Periodic endomorphisms of a free monoid (Q1346302) (← links)
- Ranks of binary relations (Q1357114) (← links)
- Free submonoids in the monoid of languages (Q1381858) (← links)
- Coding properties of DNA languages. (Q1401178) (← links)
- On low-complexity bi-infinite words and their factors (Q1606164) (← links)
- On the ratio of prefix codes to all uniquely decodable codes with a given length distribution (Q1752605) (← links)
- Codes induced by alternative codes (Q1752957) (← links)
- Generating boxes from ordered sets and graphs (Q1803662) (← links)
- Maximal prefix products (Q1821877) (← links)
- On the deficit of a finite set of words (Q1822632) (← links)
- An order topology for finitely generated free monoids (Q1823968) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- Valuations, regular expressions, and fractal geometry (Q1908904) (← links)
- Logarithmic density and measures on semigroups (Q1911861) (← links)
- Left-divisibility and word problems in single relation monoids (Q1924517) (← links)
- A sufficient condition for the Hanna Neumann property of submonoids of a free monoid. (Q1955591) (← links)
- Codes and noncommutative stochastic matrices (Q1959746) (← links)
- Generalised operations in free harmonic analysis (Q2009657) (← links)
- The universal Boolean inverse semigroup presented by the abstract Cuntz-Krieger relations (Q2043510) (← links)
- On the homological classification of semigroups with local units (Q2048991) (← links)
- On certain inverse semigroups associated with one-sided topological Markov shifts (Q2082747) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
