The equivalence of pre-NTS grammars is decidable (Q3992022): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+NTS languages are deterministic and congruential
@@ Property / cites work: NTS languages are deterministic and congruential / rank @@
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+A new class of C.F.L. for which the equivalence is decidable
+Normal rank
@@ Property / cites work @@
+The equivalence and inclusion problems for NTS languages
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic finite-turn pushdown automata
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3992022