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)

Related topics

Related topics

8 relations
Binary treeDepth-first searchFinite-state machinePebble automaton

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
An Unsupervised Approach For Gait Phase Detection
Gait phase partitioning is an extremely important aspect of gait abnormality detection. Generally, high-cost motion capture… 
2019
2019
A Discretely Assembled Walking Motor
We introduce a discrete approach to robotic construction that enables the integration of structure, mechanism, and actuation and… 
2018
2018
Analyses of biped walking posture by dynamical-evaluating index
In this paper, biped walking posture and design are evaluated through dynamic reconfiguration manipulability shape index (DRMSI… 
2014
2014
Design of a reconfigurable spherical robot II
This paper describes the design of a three-legged reconfigurable spherical robot II. The reconfigurable spherical robot II is… 
2012
2012
Study on Vibration Experiment of Shearer Walking
Through establishing test-bed of shearer walking and using different arrangement of monitoring points,the vibration experiment… 
2009
2009
Weighted Tree-Walking Automata
We define weighted tree-walking automata. We show that the class of tree series recognizable by weighted tree-walking automata… 
2008
2008
Pebble Alternating Tree-Walking Automata and Their Recognizing Power
Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree… 
2007
2007
GROUND REACTION FORCES, REARFOOT MOTION AND WRIST ACCELERATION IN NORDIC WALKING
The aim of this study was to analyze loading parameters in nordic walking (NW) compared to ordinary walking (W) with respect to… 
2006
2006
Properties of Binary Transitive Closure Logics over Trees
Binary transitive closure logic (FOfor short) is the extension of first-order predicate logic by a transitive closure operator of… 
1992
1992
The Walking Muse
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)