Word problems over traces which are solvable in linear time (Q5096152): Difference between revisions

@@ Property / cites work @@
+Theory of traces
@@ Property / cites work: Theory of traces / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting systems and word problems in a free partially commutative monoid
+Normal rank
@@ Property / cites work @@
+Confluent and Other Types of Thue Systems
@@ Property / cites work: Confluent and Other Types of Thue Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems of commutation and rearrangements
+Normal rank
@@ Property / cites work @@
+Partial commutations and faithful rational transductions
+Normal rank
@@ Property / cites work @@
+Q3736919
@@ Property / cites work: Q3736919 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3771597
@@ Property / cites work: Q3771597 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal serializability of iterated transactions
@@ Property / cites work: Maximal serializability of iterated transactions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3771629
@@ Property / cites work: Q3771629 / rank @@
+Normal rank
@@ Property / cites work @@
+Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
+Normal rank
@@ Property / cites work @@
+Q3754627
@@ Property / cites work: Q3754627 / rank @@
+Normal rank
@@ Property / cites work @@
+The word problem for free partially commutative groups
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bfb0028982
+Normal rank
@@ Property / OpenAlex ID @@
+W4237916620
@@ Property / OpenAlex ID: W4237916620 / rank @@
+Normal rank