# Computations by fly-automata beyond monadic second-order logic

arXiv: https://arxiv.org/abs/1305.7120 · HTML: https://mlsanity.com/paper/1305.7120/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 May 2013.

## Built on by (most cited first, 1 of 1)

- [From Width-Based Model Checking to Width-Based Automated Theorem Proving](https://mlsanity.com/paper/2205.10995/) (2022)

## Abstract (arXiv)

We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not monadic second-order expressible because their states may include counters, so that their sets of states may be infinite. We equip these automata with output functions, so that they can compute values associated with terms or graphs. Rather than new algorithmic results we present tools for constructing easily certain dynamic programming algorithms by combining predefined automata for basic functions and properties.