Sciweavers

Share
BIRTHDAY
2008
Springer

Tree Automata over Infinite Alphabets

8 years 9 months ago
Tree Automata over Infinite Alphabets
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare their computation power.
Michael Kaminski, Tony Tan
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where BIRTHDAY
Authors Michael Kaminski, Tony Tan
Comments (0)
books