Scholarlink

The automata-logic correspondence, starting with automata on finite words, whose fundamentals are presented in Chp. 2, has been extended in two directions: Chp. 5 considers infinite words, and Chp. 11 considers finite trees. In all three cases, Monadic Second-Order Logic has been shown to be equi-expressive to a natural model of finite automata over the respective word or tree structures.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Parity Games

  • 章节

  • 发表日期：

    2025年

查看全文
  • Martin Hofmann,
  • Martin Lange

摘要

The automata-logic correspondence, starting with automata on finite words, whose fundamentals are presented in Chp. 2, has been extended in two directions: Chp. 5 considers infinite words, and Chp. 11 considers finite trees. In all three cases, Monadic Second-Order Logic has been shown to be equi-expressive to a natural model of finite automata over the respective word or tree structures.