A limit theorem for set of subwords in deterministic TOL laguages (Q1215275): Difference between revisions

@@ Property / author @@
+Grzegorz Rozenberg
@@ Property / author: Grzegorz Rozenberg / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(73)90003-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2075043804
@@ Property / OpenAlex ID: W2075043804 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124350
@@ Property / cites work: Q4124350 / rank @@
+Normal rank
@@ Property / cites work @@
+TOL systems and languages
@@ Property / cites work: TOL systems and languages / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic TOL-systems is undecidable
+Normal rank
@@ Property / cites work @@
+DOL sequences
@@ Property / cites work: DOL sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Extension of tabled 0L-systems and languages
@@ Property / cites work: Extension of tabled 0L-systems and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank