A decidability result for deterministic \(\omega\)-context-free languages (Q1239008): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(77)90058-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2043998485
@@ Property / OpenAlex ID: W2043998485 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+Theories of automata on \(\omega\)-tapes: a simplified approach
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic context free languages
@@ Property / cites work: Deterministic context free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Decision problems forω-automata
@@ Property / cites work: Decision problems forω-automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4082317
@@ Property / cites work: Q4082317 / rank @@
+Normal rank
@@ Property / cites work @@
+On ω-sets associated with context-free languages
@@ Property / cites work: On ω-sets associated with context-free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+Q3214824
@@ Property / cites work: Q3214824 / rank @@
+Normal rank