Automata-based presentations of infinite structures

@inproceedings{Brny2009AutomatabasedPO,
  title={Automata-based presentations of infinite structures},
  author={Vince B{\'a}r{\'a}ny and Erich Gr{\"a}del and Sasha Rubin},
  year={2009}
}
The model theory of finite structures is intimately connected to various fields in computer science, including complexity theory, databases, and verification. In particular, there is a close relationship between complexity classes and the expressive power of logical languages, as witnessed by the fundamental theorems of descriptive complexity theory, such as Fagin’s Theorem and the ImmermanVardi Theorem (see [78, Chapter 3] for a survey). However, for many applications, the strict limitation to… CONTINUE READING
10 Citations
130 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 130 references

Propriétés et représentation de structures infinies

  • Th. Colcombet
  • Thèse de doctorat, Université Rennes I,
  • 2004
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…