Approximate minimization of weighted tree automata

Approximate minimization of weighted tree automata

This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a weighted tree language f, can we construct a smaller automaton Aˆ with nˆ

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information and computation 2022-01, Vol.282, p.104654, Article 104654
Hauptverfasser: Balle, Borja, Rabusseau, Guillaume
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a weighted tree language f, can we construct a smaller automaton Aˆ with nˆ
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2020.104654