Scholarlink

A natural question that arises with the study of finite automata operating on finite words and the two extensions to infinite words and finite trees, concerns their combination. Consequently, in this chapter we will study finite automata operating on infinite trees. Any tree whose underlying node set is infinite can of course be called infinite, but we consider only finitely-branching trees in which every node has finitely many successors only.

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

Automata on Infinite Trees

  • 章节

  • 发表日期：

    2025年

查看全文
  • Martin Hofmann,
  • Martin Lange

摘要

A natural question that arises with the study of finite automata operating on finite words and the two extensions to infinite words and finite trees, concerns their combination. Consequently, in this chapter we will study finite automata operating on infinite trees. Any tree whose underlying node set is infinite can of course be called infinite, but we consider only finitely-branching trees in which every node has finitely many successors only.