Publisher
Springer International Publishing
Reference25 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991). https://doi.org/10.1016/0196-6774(91)90006-K
2. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University Press (1962)
3. Lecture Notes in Computer Science;A Carayol,2003
4. Lecture Notes in Computer Science;D Caucal,2002
5. Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290(1), 79–115 (2003). https://doi.org/10.1016/S0304-3975(01)00089-5