Sciweavers

DLT
2008
14 years 28 days ago
Construction of Tree Automata from Regular Expressions
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
Dietrich Kuske, Ingmar Meinecke