Björn Borchardt

According to our database, Björn Borchardt authored at least 6 papers between 2003 and 2006.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2006

Cut sets as recognizable tree languages.

Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler

Fuzzy Sets Syst., 2006

2005

Bounds for Tree Automata with Polynomial Costs.

Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti

J. Autom. Lang. Comb., 2005

2004

A Pumping Lemma and Decidability Problems for Recognizable Tree Series.

Björn Borchardt

Acta Cybern., 2004

Code Selection by Tree Series Transducers.

Björn Borchardt

Proceedings of the Implementation and Application of Automata, 2004

2003

Determinization of Finite State Weighted Tree Automata.

Björn Borchardt, Heiko Vogler

J. Autom. Lang. Comb., 2003

The Myhill-Nerode Theorem for Recognizable Tree Series.

Björn Borchardt

Proceedings of the Developments in Language Theory, 7th International Conference, 2003