Sciweavers

556 search results - page 112 / 112
» Checking Interval Properties of Computations
Sort
View
IANDC
2011
129views more  IANDC 2011»
13 years 17 days ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher