Skip to search formSkip to main contentSkip to account menu

Tree walking automaton

A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
The humanoid robot, specifically the NAO robot must be able to provide a highly dynamic performance on the soccer field… 
2014
2014
The first walking football challenge match in the Borders took place on Friday when a team from Peebles faced opponents from… 
2011
2011
We introduce weighted expressions, a calculus to express quantitative properties over unranked trees. They involve products and… 
2008
2008
This study elucidated the cell division mechanism in the bacterial phylum Verrucomicrobia . In contrast to previous assumptions… 
2007
2007
The aim of this study was to analyze loading parameters in nordic walking (NW) compared to ordinary walking (W) with respect to… 
2007
2007
Emmanuel Cordier, Ambarish Goswami, Mathieu Bourlier* INRIA Rhone-Alpes and *University of Joseph Fourier, Grenoble, France 1… 
2006
2006
Binary transitive closure logic (FOfor short) is the extension of first-order predicate logic by a transitive closure operator of… 
2000
2000
In this paper we extend the work by Michaelis (1999) which sho ws how to encode an arbitrary Minimalist Grammar in the sense of… 
1997
1997
A formula from monadic second order (mso) logic with one free variable can be used to de ne a property of the nodes of a tree… 
1990
1990