Change search
ReferencesLink to record
Permanent link

Direct link
Backward and forward bisimulation minimisation of tree automata
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2007 (English)In: Implementation and Application of Automata: 12th International Conference, CIAA 2007, 2007Conference paper (Refereed)
Abstract [en]

We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Minimisation via forward bisimulation is effective for deterministic automata and faster than the previous algorithm. Minimisation via backward bisimulation generalises the previous algorithm and is thus more effective but just as fast. We demonstrate implementations of these algorithms on a typical task in natural language processing.

Place, publisher, year, edition, pages
, Lecture notes in computer science, ISSN 0302-9743
URN: urn:nbn:se:umu:diva-2416OAI: diva2:140397
Available from: 2007-05-16 Created: 2007-05-16Bibliographically approved
In thesis
1. Contributions to the theory and applications of tree languages
Open this publication in new window or tab >>Contributions to the theory and applications of tree languages
2007 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis is concerned with theoretical as well as practical aspects of tree languages. It consists of an introduction and eight papers, organised into three parts. The first part is devoted to algorithmic learning of regular tree languages, the second part to bisimulation minimisation of tree automata, and the third part to tree-based generation of music. We now summarise the contributions made in each part.

In Part I, an inference algorithm for regular tree languages is presented. The algorithm is a generalisation of a previous algorithm by Angluin, and the learning task is to derive, with the aid of a so-called MAT-oracle, the minimal (partial and deterministic) finite tree automaton M that recognises the target language U over some ranked alphabet Σ. The algorithm executes in time O(|Q| |δ| (m + |Q|)), where Q and δ are the set of states and the transition table of M , respectively, r is the maximal rank of any symbol in Σ, and m is the maximum size of any answer given by the oracle. This improves on a similar algorithm by Sakakibara as dead states are avoided both in the learning phase and in the resulting automaton. Part I also describes a concrete implementation which includes two extensions of the basic algorithm.

In Part II, bisimulation minimisation of nondeterministic weighted tree automata (henceforth, wta) is introduced in general, and for finite tree automata (which can be seen as wta over the Boolean semiring) in particular. The concepts of backward and forward bisimulation are extended to wta, and efficient minimisation algorithms are developed for both types of bisimulation. In the special case where the underlying semiring of the input automaton is either cancellative or Boolean, these minimisation algorithms can be further optimised by adapting existing partition refinement algorithms by Hopcroft, Paige, and Tarjan. The implemented minimisation algorithms are demonstrated on a typical task in natural language processing.

In Part III, we consider how tree-based generation can be applied to algorithmic composition. An algebra is presented whose operations act on musical pieces, and a system capable of generating simple musical pieces is implemented in the software Treebag: starting from input which is either generated by a regular tree grammar or provided by the user via a digital keyboard, a number of top-down tree transducers are applied to generate a tree over the operations provided by the music algebra. The evaluation of this tree yields the musical piece generated.

Place, publisher, year, edition, pages
Umeå: Datavetenskap, 2007. 32 p.
Report / UMINF, ISSN 0348-0542 ; 07.07
regular tree languages, tree series, algorithmic learning, MAT-learning, bisimulation minimisation, tree-based generation, algorithmic composition, music algebra
National Category
Computer Science
urn:nbn:se:umu:diva-1152 (URN)978-91-7264-336-9 (ISBN)
Public defence
2007-09-07, MA121, MIT huset, Umeå Universitet, Umeå, 13:00 (English)
Available from: 2007-05-16 Created: 2007-05-16 Last updated: 2009-10-23Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Högberg, Johanna
By organisation
Department of Computing Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 39 hits
ReferencesLink to record
Permanent link

Direct link