Linearly bounded infinite graphs (Q852011): Difference between revisions

@@ Property / DOI @@
-.1007/s00236-006-0022-z
@@ Property / DOI: 10.1007/s00236-006-0022-z / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3102239021
@@ Property / OpenAlex ID: W3102239021 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3487
@@ Property / arXiv ID: 0705.3487 / rank @@
+Normal rank
@@ Property / cites work @@
+Context-Sensitive Languages, Rational Graphs and Determinism
+Normal rank
@@ Property / cites work @@
+Q4818835
@@ Property / cites work: Q4818835 / rank @@
+Normal rank
@@ Property / cites work @@
+On infinite transition graphs having a decidable monadic theory
+Normal rank
@@ Property / cites work @@
+On the transition graphs of Turing machines.
@@ Property / cites work: On the transition graphs of Turing machines. / rank @@
+Normal rank
@@ Property / cites work @@
+An internal presentation of regular graphs by prefix-recognizable graphs
+Normal rank
@@ Property / cites work @@
+Q4708568
@@ Property / cites work: Q4708568 / rank @@
+Normal rank
@@ Property / cites work @@
+On certain formal properties of grammars
@@ Property / cites work: On certain formal properties of grammars / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs, II: Infinite graphs of bounded width
+Normal rank
@@ Property / cites work @@
+On Relations Defined by Generalized Finite Automata
+Normal rank
@@ Property / cites work @@
+Synchronized rational relations of finite and infinite words
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Q4934344
@@ Property / cites work: Q4934344 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of languages and linear-bounded automata
@@ Property / cites work: Classes of languages and linear-bounded automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508307
@@ Property / cites work: Q4508307 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779172
@@ Property / cites work: Q4779172 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of ends, pushdown automata, and second-order logic
+Normal rank
@@ Property / cites work @@
+Q4526683
@@ Property / cites work: Q4526683 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2842874
@@ Property / cites work: Q2842874 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of bisimulation equivalence for normed pushdown processes
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Q4737901
@@ Property / cites work: Q4737901 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a $k$-valued transducer into $k$ unambiguous ones
+Normal rank
@@ Property / DOI @@
+.1007/S00236-006-0022-Z
@@ Property / DOI: 10.1007/S00236-006-0022-Z / rank @@
+Normal rank