Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Arbology: Trees and pushdown automata

Bořivoj MelicharJan JanoušekTomas Flouri — 2012

Kybernetika

We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata...

Page 1

Download Results (CSV)