Unrestricted complementation in language equations over a one-letter alphabet (Q1334656): Difference between revisions

@@ Property / author @@
-Ernst L. Leiss
@@ Property / author: Ernst L. Leiss / rank @@
-Normal rank
@@ 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/0304-3975(94)90227-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2064508306
@@ Property / OpenAlex ID: W2064508306 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5725992
@@ Property / cites work: Q5725992 / rank @@
+Normal rank
@@ Property / cites work @@
+On equations for regular languages, finite automata, and sequential networks
+Normal rank
@@ Property / cites work @@
+On generalized language equations
@@ Property / cites work: On generalized language equations / rank @@
+Normal rank
@@ Property / cites work @@
+On solving star equations
@@ Property / cites work: On solving star equations / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized language equations with multiple solutions
+Normal rank
@@ Property / cites work @@
+Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
+Normal rank
@@ Property / cites work @@
+Q5588675
@@ Property / cites work: Q5588675 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1334656