| Information | |
|---|---|
| has gloss | eng: In computer science and mathematical logic, A infinite tree automaton is a state machine that deals with infinite tree structure. It can be viewed as an extension from finite tree automaton, which accepts only finite tree structures. It can also be viewed as extension of some infinite word automatons such as buchi automaton and rabin automaton. |
| lexicalization | eng: infinite tree automaton |
| instance of | e/Tree (data structure) |
| Media | |
|---|---|
| media:img | An example of infinite tree structure.png |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint
