FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS (Q5462118): Difference between revisions

@@ Property / author @@
-Hans Zantema
@@ Property / author: Hans Zantema / rank @@
-Normal rank
@@ Property / author @@
+Hans Zantema
@@ Property / author: Hans Zantema / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic Thue systems
@@ Property / cites work: Monadic Thue systems / rank @@
+Normal rank
@@ Property / cites work @@
+Cancellation rules and extended word problems
@@ Property / cites work: Cancellation rules and extended word problems / rank @@
+Normal rank
@@ Property / cites work @@
+Match-bounded string rewriting systems
@@ Property / cites work: Match-bounded string rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Context-Limited Grammars
@@ Property / cites work: Context-Limited Grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Deleting string rewriting systems preserve regularity
+Normal rank
@@ Property / cites work @@
+A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
+Normal rank