The following pages link to (Q4001349):
Displayed 36 items.
- Some property-preserving homomorphisms (Q4649000) (← links)
- Squares of regular languages (Q4680378) (← links)
- <i>n</i>-Prefix–suffix languages<sup>∗</sup> (Q4730802) (← links)
- Morphisms preserving densities (Q4780547) (← links)
- Finite Completion of comma-free codes Part 1 (Q4825390) (← links)
- Finite Completion of comma-free codes Part 2 (Q4825391) (← links)
- Brick codes: families, properties, relations (Q4954026) (← links)
- (Q4988154) (← links)
- (Q4988158) (← links)
- (Q4988161) (← links)
- Accepting networks of evolutionary processors with resources restricted and structure limited filters (Q5021112) (← links)
- (Q5061518) (← links)
- On primitive words with non-primitive product (Q5066975) (← links)
- Insertion and deletion of words: Determinism and reversibility (Q5096843) (← links)
- Networks with Evolutionary Processors and Ideals and Codes as Filters (Q5217115) (← links)
- Randomized generation of error control codes with automata and transducers (Q5223614) (← links)
- Restricted Burnside problem for semigroups and its application to language theory (Q5370751) (← links)
- <i>P</i>-disjunctive ω-languages (Q5391463) (← links)
- <i>k</i>-involution codes and related sets (Q5446253) (← links)
- Overlapping words, codes, disjunctivity and density of languages (Q5451458) (← links)
- Watson-Crick Conjugate and Commutative Words (Q5452701) (← links)
- Languages and P0L schemes (Q5699917) (← links)
- \(k\)-p-infix codes and semaphore codes (Q5931791) (← links)
- Post-plus languages (Q5941064) (← links)
- Count of primitive words (Q5952877) (← links)
- Finite maximal solid codes (Q5958127) (← links)
- Operations and language generating devices suggested by the genome evolution (Q5958327) (← links)
- Characterizations of \(k\)-comma codes and \(k\)-comma intercodes (Q5963402) (← links)
- On the complexity of decision problems for some classes of machines and applications (Q6077841) (← links)
- The second step in characterizing a three-word code (Q6090990) (← links)
- Systems of equations over a finite set of words and automata theory (Q6114515) (← links)
- (Q6149979) (← links)
- Rich words in the block reversal of a word (Q6157425) (← links)
- Merging two hierarchies of external contextual grammars with subregular selection (Q6175098) (← links)
- Relations of contextual grammars with strictly locally testable selection languages (Q6186541) (← links)
- Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars (Q6204140) (← links)