The following pages link to (Q3948608):
Displaying 50 items.
- On syntactic nuclei of rational languages (Q293361) (← links)
- Square-free words with one possible mismatch (Q297663) (← links)
- On CD-systems of stateless deterministic R-automata with window size one (Q439938) (← links)
- Some algorithms for equivalent transformation of nondeterministic finite automata (Q462609) (← links)
- Regularity of sets of initial strings of periodic D0L-systems (Q580989) (← links)
- On the subword complexity of m-free DOL languages (Q594602) (← links)
- Language-theoretic problems arising from Richelieu cryptosystems (Q685369) (← links)
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- Some remarks on non-algebraic adherences (Q786543) (← links)
- L codes and number systems (Q788495) (← links)
- Unique representation in number systems and L codes (Q792953) (← links)
- Infinite arrays and controlled deterministic table 0L array systems (Q797993) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- On the subword complexity of DOL languages with a constant distribution (Q798008) (← links)
- On k-repetition freeness of length uniform morphisms over a binary alphabet (Q799123) (← links)
- Complexity of normal form grammars (Q799380) (← links)
- On regularity of languages generated by copying systems (Q800098) (← links)
- Many aspects of formal languages (Q805241) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- Polynomial growth in semigroup varieties. (Q952539) (← links)
- On the size of the alphabet and the subword complexity of square-free DOL languages (Q1050120) (← links)
- A complete inference system for a class of regular behaviours (Q1057072) (← links)
- Code properties and homomorphisms of DOL systems (Q1058858) (← links)
- A homomorphic characterization of recursively enumerable languages (Q1061494) (← links)
- Homomorphisms of 3-chromatic graphs (Q1062066) (← links)
- A characterization of power-free morphisms (Q1062467) (← links)
- On three-element codes (Q1063421) (← links)
- Feedback automata and their languages (Q1064078) (← links)
- On infinite words obtained by selective substitution grammars (Q1066676) (← links)
- Test sets for morphisms with bounded delay (Q1067414) (← links)
- Adherences of DOL languages (Q1072713) (← links)
- Repetition-free words (Q1078338) (← links)
- Truncations of infinite matrices and algebraic series associated with some CF grammars (Q1079959) (← links)
- A property of three-element codes (Q1083216) (← links)
- On morphic generation of regular languages (Q1083217) (← links)
- Periodic D0L languages (Q1093376) (← links)
- On purely morphic characterizations of context-free languages (Q1098315) (← links)
- Bounded D0L languages (Q1098317) (← links)
- On a public-key cryptosystem based on iterated morphisms and substitutions (Q1098821) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- A defect property of codes with unbounded delays (Q1113876) (← 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)
- Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages (Q1160495) (← links)
- A homomorphic characterization of regular languages (Q1162364) (← links)
- Permutations are not context-free: An application of the interchange lemma (Q1165021) (← links)
- On infinite words obtained by iterating morphisms (Q1168084) (← links)
- A note on morphic characterization of languages (Q1171887) (← links)
- Fibonacci morphisms and Sturmian words (Q1177169) (← links)
