Subword complexities of various classes of deterministic developmental languages without interactions (Q1221635): Difference between revisions

@@ Property / cites work @@
+Q5653575
@@ Property / cites work: Q5653575 / rank @@
+Normal rank
@@ Property / cites work @@
+A limit theorem for set of subwords in deterministic TOL laguages
+Normal rank
@@ Property / cites work @@
+Characterization of unary developmental languages
@@ Property / cites work: Characterization of unary developmental languages / rank @@
+Normal rank
@@ Property / cites work @@
+Description of developmental languages using recurrence systems
+Normal rank
@@ Property / cites work @@
+The length sets of D0L languages are uniformly bounded
+Normal rank
@@ Property / cites work @@
+Q4124350
@@ Property / cites work: Q4124350 / rank @@
+Normal rank
@@ Property / cites work @@
+Integral sequential word functions and growth equivalence of lindenmayer systems
+Normal rank
@@ Property / cites work @@
+DOL sequences
@@ Property / cites work: DOL sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Q4060423
@@ Property / cites work: Q4060423 / rank @@
+Normal rank
@@ Property / cites work @@
+On 0L-Languages
@@ Property / cites work: On 0L-Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Development systems with locally catenative formulas
+Normal rank
@@ Property / cites work @@
+Q5684248
@@ Property / cites work: Q5684248 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5666178
@@ Property / cites work: Q5666178 / rank @@
+Normal rank