| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436591 | Theoretical Computer Science | 2014 | 21 Pages |
Abstract
We introduce the mix operation for hedges and the shuffle operation for unranked trees. We show that the shuffle of recognizable tree languages is also a recognizable tree language.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sándor Vágvölgyi,