The supports of weighted unranked tree automata
From MaRDI portal
Publication:2805397
DOI10.3233/FI-2015-1143zbMATH Open1341.68088MaRDI QIDQ2805397FDOQ2805397
Authors: Doreen Heusel, Manfred Droste
Publication date: 11 May 2016
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 6124028
- Weighted finite automata over strong bimonoids
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- A Nivat theorem for quantitative automata on unranked trees
- Weighted tree automata and tree transducers
- Weighted logics for unranked tree automata
- Weighted tree-walking automata
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- scientific article; zbMATH DE number 7644294
- Crisp-determinization of weighted tree automata over strong bimonoids
unranked treebimonoidnested weighted automatonsupport of a tree seriesweighted pushdown automatonweighted unranked tree automaton
Cited In (5)
This page was built for publication: The supports of weighted unranked tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805397)