A P-complete language describable with iterated shuffle (Q1197969): Difference between revisions

@@ Property / cites work @@
+Flow languages equal recursively enumerable languages
+Normal rank
@@ Property / cites work @@
+The power of synchronizing operations on strings
@@ Property / cites work: The power of synchronizing operations on strings / rank @@
+Normal rank
@@ Property / cites work @@
+Extending regular expressions with iterated shuffle
+Normal rank
@@ Property / cites work @@
+On the enlargement of the class of regular languages by the shuffle closure
+Normal rank
@@ Property / cites work @@
+Software Descriptions with Flow Expressions
@@ Property / cites work: Software Descriptions with Flow Expressions / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of iterated shuffle
@@ Property / cites work: On the complexity of iterated shuffle / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90165-r
+Normal rank
@@ Property / OpenAlex ID @@
+W1989896950
@@ Property / OpenAlex ID: W1989896950 / rank @@
+Normal rank