scientific article; zbMATH DE number 2211801

zbMath1094.68046MaRDI QIDQ5694616

Björn Borchardt

Publication date: 4 October 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pumping lemmabottom-up finite state weighted tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (20)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Definable transductions and weighted logics for texts ⋮ Weighted tree automata and weighted logics ⋮ Minimisation of Multiplicity Tree Automata ⋮ Efficient enumeration of weighted tree languages over the tropical semiring ⋮ Unnamed Item ⋮ Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Weighted logics for unranked tree automata ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ Approximated determinisation of weighted tree automata ⋮ Sequentiality of group-weighted tree automata ⋮ Cut sets as recognizable tree languages ⋮ An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring ⋮ MAT learners for tree series: an abstract data type and two realizations ⋮ Minimizing deterministic weighted tree automata ⋮ Disambiguation of weighted tree automata

This page was built for publication: