Model-Checking by Infinite Fly-Automata
We present logic based methods for constructing XP and FPT graph algorithms, parameterized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make it possible to check properties that are not monadic second-order expressible because their states may include counters, so that their set of states may be infinite. We equip these automata with output functions, so that they can compute values associated with terms or graphs. We present tools for constructing easily algorithms by combining predefined automata for basic functions and properties.
KeywordsOutput Function Chromatic Polynomial Syntactic Tree Nondeterministic Automaton Acyclic Coloring
Unable to display preview. Download preview PDF.
- 5.Courcelle, B., Durand, I.: Computations by fly-automata beyond monadic second-order logic (preprint, June 2013)Google Scholar
- 6.Courcelle, B., Durand, I.: Infinite transducers on terms denoting graphs In: Proceedings of the 6th European Lisp Symposium, Madrid (June 2013)Google Scholar
- 7.Courcelle, B., Engelfriet, J.: Graph structure and monadic second-order logic, a language theoretic approach. Encyclopedia of mathematics and its application, vol. 138. Cambridge University Press (June 2012)Google Scholar
- 9.Durand, I.: Object enumeration. In: Proceedings of the 5th European LISP Conference, Zadar, Croatia, pp. 43–57 (May 2012)Google Scholar
- 10.Downey, R., Fellows, M.: Parameterized complexity. Springer (1999)Google Scholar
- 12.Flum, J., Grohe, M.: Parametrized complexity theory. Springer (2006)Google Scholar