Weighted grammars and Kleene's theorem
From MaRDI portal
Publication:1090465
DOI10.1016/0020-0190(87)90190-6zbMath0621.68046OpenAlexW2030307112MaRDI QIDQ1090465
Athanasios Alexandrakis, Symeon Bozapalidis
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90190-6
Related Items (23)
Crisp-determinization of weighted tree automata over strong bimonoids ⋮ A note on cut-worthiness of recognizable tree series ⋮ Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Unnamed Item ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Weighted logics for unranked tree automata ⋮ Nonassociativity à la Kleene ⋮ Approximated determinisation of weighted tree automata ⋮ Sequentiality of group-weighted tree automata ⋮ -Treeautomata and their relation to weighted context-free grammars ⋮ Weighted monadic Datalog ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ A Kleene theorem for weighted tree automata over tree valuation monoids ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA ⋮ Principal abstract families of weighted tree languages ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Equational weighted tree transformations ⋮ On two families of forests
Cites Work
This page was built for publication: Weighted grammars and Kleene's theorem
