Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Reachability is harder for directed than for undirected finite graphs;Ajtai;Journal of Symbolic Logic,1990
2. Weak second-order arithmetic and finite automata;Büchi;Zeitschrift für Mathematische Logik und Grundlagen der Mathematik,1960
3. Monadic second-order definable graph transductions: A survey;Courcelle;Theoretical Computer Science,1994
4. The Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs;Ehrenfeucht,1999
5. Decision problems of finite automata design and related arithmetics;Elgot;Transactions of the AMS,1961
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Definable transductions and weighted logics for texts;Theoretical Computer Science;2010-01
2. Two Variables and Two Successors;Mathematical Foundations of Computer Science 2010;2010