The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825): Difference between revisions

@@ Property / author @@
+Ernst L. Leiss
@@ Property / author: Ernst L. Leiss / 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/0022-0000(81)90070-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2036210786
@@ Property / OpenAlex ID: W2036210786 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5725992
@@ Property / cites work: Q5725992 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590815
@@ Property / cites work: Q5590815 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5579037
@@ Property / cites work: Q5579037 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic generation of efficient lexical processors using finite state techniques
+Normal rank
@@ Property / cites work @@
+Q5536277
@@ Property / cites work: Q5536277 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586367
@@ Property / cites work: Q5586367 / rank @@
+Normal rank
@@ Property / cites work @@
+Programming Techniques: Regular expression search algorithm
+Normal rank