Decision procedures for inductive Boolean functions based on alternating automata (Q1399969): Difference between revisions

@@ Property / cites work @@
+On equations for regular languages, finite automata, and sequential networks
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3323279
@@ Property / cites work: Q3323279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the space complexity of some decision problems for finite automata
+Normal rank
@@ Property / cites work @@
+Q4218939
@@ Property / cites work: Q4218939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4090322
@@ Property / cites work: Q4090322 / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness results concerning systolic tree automata and E0L languages
+Normal rank
@@ Property / cites work @@
+Alternating tree automata
@@ Property / cites work: Alternating tree automata / rank @@
+Normal rank