A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016): Difference between revisions

@@ 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/j.ipl.2007.06.006
+Normal rank
@@ Property / OpenAlex ID @@
+W1999507562
@@ Property / OpenAlex ID: W1999507562 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+On a family of L languages resulting from systolic tree automata
+Normal rank
@@ Property / cites work @@
+Q5486002
@@ Property / cites work: Q5486002 / rank @@
+Normal rank
@@ Property / cites work @@
+DP lower bounds for equivalence-checking and model-checking of one-counter automata
+Normal rank
@@ Property / cites work @@
+A note on the space complexity of some decision problems for finite automata
+Normal rank
@@ Property / cites work @@
+Completeness results concerning systolic tree automata and E0L languages
+Normal rank
@@ Property / cites work @@
+Q4140407
@@ Property / cites work: Q4140407 / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Software Science and Computation Structures
+Normal rank
@@ Property / cites work @@
+Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2380016