The following pages link to (Q3653240):
Displaying 50 items.
- Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions (Q410708) (← links)
- Relativized codes (Q418759) (← links)
- Groups and decompositions of codes (Q442247) (← links)
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- A Kraft-McMillan inequality for free semigroups of upper-triangular matrices (Q476180) (← links)
- On the decomposition of prefix codes (Q517038) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Representation theory of finite semigroups over semirings. (Q657946) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Embeddings of local automata (Q716395) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- Maximal bifix codes of degree 3 (Q723611) (← links)
- Shifts of \(k\)-nested sequences (Q728261) (← links)
- Neutral and tree sets of arbitrary characteristic (Q728278) (← links)
- Finite maximal codes and triangle conjecture (Q729792) (← links)
- Bernoulli measure on strings, and Thompson-Higman monoids. (Q766121) (← links)
- New results on Nyldon words and Nyldon-like sets (Q820920) (← links)
- Reducing local alphabet size in recognizable picture languages (Q832926) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- On the groups of codes with empty kernel. (Q982209) (← links)
- Unified theory for finite Markov chains (Q1735485) (← links)
- Completely simple codes (Q1939491) (← links)
- Recognizability of the support of recognizable series over the semiring of the integers is undecidable (Q1944933) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- Codes and noncommutative stochastic matrices (Q1959746) (← links)
- Simplicity of augmentation submodules for transformation monoids (Q2042297) (← links)
- Some combinatorial properties of solid codes (Q2065362) (← links)
- The intersection of \(3\)-maximal submonoids (Q2067614) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Binary codes that do not preserve primitivity (Q2104527) (← links)
- Theoretical and implementational aspects of the formal language server (LaSer) (Q2106613) (← links)
- Two-dimensional codes (Q2106615) (← links)
- State complexity of binary coded regular languages (Q2112182) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Conway's work on iteration (Q2153969) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- On the group of a rational maximal bifix code (Q2178790) (← links)
- Some results on \((k, m)\)-comma codes (Q2196433) (← links)
- Graded alphabets, circular codes, free Lie algebras and comma-free codes (Q2219960) (← links)
- Homomorphic characterization of tree languages based on comma-free encoding (Q2232286) (← links)
- Automata for solid codes (Q2235761) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- The finite index basis property (Q2259171) (← links)
- Bifix codes and interval exchanges (Q2259187) (← links)
- Unique decipherability in formal languages (Q2283038) (← links)
- Embedding a \(\theta \)-invariant code into a complete one (Q2285122) (← links)
- Nyldon words (Q2318478) (← links)
- Acyclic, connected and tree sets (Q2339363) (← links)
- Specular sets (Q2358694) (← links)
