What makes some language theory problems undecidable (Q2540268): Difference between revisions

@@ Property / author @@
-John E. Hopcrofts
@@ Property / author: John E. Hopcrofts / rank @@
-Normal rank
@@ Property / author @@
+John E. Hopcrofts
@@ Property / author: John E. Hopcrofts / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+An Approach to a Unified Theory of Automata
@@ Property / cites work: An Approach to a Unified Theory of Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Studies in abstract families of languages
@@ Property / cites work: Studies in abstract families of languages / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
+Normal rank
@@ Property / cites work @@
+One-way stack automata
@@ Property / cites work: One-way stack automata / rank @@
+Normal rank
@@ Property / cites work @@
+A note on undecidable properties of formal languages
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2540268