Infinite-tree automaton
id:
infinite-tree-automaton-240-12237437
title:
Infinite-tree automaton
text:
In computer science and mathematical logic, an infinite-tree automaton is a state machine that deals with infinite tree structures. It can be seen as an extension of top-down finite-tree automata to infinite trees or as an extension of infinite-word automata to infinite trees. A finite automaton which runs on an infinite tree was first used by Michael Rabin for proving decidability of S2S, the monadic second-order theory with two successors. It has been further observed that tree automata and lo
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical structure
original url:
https://en.wikipedia.org/wiki/Infinite-tree_automaton
date created:
date modified:
2024-04-14T16:01:21Z
main entity:
{"identifier":"Q6029880","url":"https://www.wikidata.org/entity/Q6029880"}
image:
fields total:
13
integrity:
14