 | 2006 |
|---|
| 6 |       | Björn Borchardt,
Andreas Maletti,
Branimir Seselja,
Andreja Tepavcevic,
Heiko Vogler:
Cut sets as recognizable tree languages.
Fuzzy Sets and Systems 157(11): 1560-1571 (2006) |
| 2005 |
|---|
| 5 |  | Björn Borchardt,
Zoltán Fülöp,
Zsolt Gazdag,
Andreas Maletti:
Bounds for Tree Automata with Polynomial Costs.
Journal of Automata, Languages and Combinatorics 10(2/3): 107-157 (2005) |
| 2004 |
|---|
| 4 | | Björn Borchardt:
Code Selection by Tree Series Transducers.
CIAA 2004: 57-67 |
| 3 | | Björn Borchardt:
A Pumping Lemma and Decidability Problems for Recognizable Tree Series.
Acta Cybern. 16(4): 509-544 (2004) |
| 2003 |
|---|
| 2 | | Björn Borchardt:
The Myhill-Nerode Theorem for Recognizable Tree Series.
Developments in Language Theory 2003: 146-158 |
| 1 | | Björn Borchardt,
Heiko Vogler:
Determinization of Finite State Weighted Tree Automata.
Journal of Automata, Languages and Combinatorics 8(3): 417-463 (2003) |
Data released under the ODC-BY 1.0 license — See also our legal information page