Some properties of iterated languages (Q2011823): Difference between revisions

@@ Property / cites work @@
+Generalized quantifiers and natural language
@@ Property / cites work: Generalized quantifiers and natural language / rank @@
+Normal rank
@@ Property / cites work @@
+State complexity of combined operations with two basic operations
+Normal rank
@@ Property / cites work @@
+Q3086925
@@ Property / cites work: Q3086925 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond the frege boundary
@@ Property / cites work: Beyond the frege boundary / rank @@
+Normal rank
@@ Property / cites work @@
+Q2702237
@@ Property / cites work: Q2702237 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113046
@@ Property / cites work: Q3113046 / rank @@
+Normal rank
@@ Property / cites work @@
+A new stable hybrid three-dimensional generalized finite difference time domain algorithm for analyzing complex structures
+Normal rank
@@ Property / cites work @@
+Q5641083
@@ Property / cites work: Q5641083 / rank @@
+Normal rank
@@ Property / cites work @@
+On a generalization of quantifiers
@@ Property / cites work: On a generalization of quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Semantics for Monadic Quantifiers
@@ Property / cites work: Computational Semantics for Monadic Quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic pushdown automata is decidable
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? decidability results from complete formal systems
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? A simplified decidability proof.
@@ Property / cites work: \(L(A)=L(B)\)? A simplified decidability proof. / rank @@
+Normal rank
@@ Property / cites work @@
+Essays in logical semantics
@@ Property / cites work: Essays in logical semantics / rank @@
+Normal rank
@@ Property / cites work @@
+Polyadic quantifiers
@@ Property / cites work: Polyadic quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank