A note on cut-worthiness of recognizable tree series
From MaRDI portal
Publication:835283
DOI10.1016/J.FSS.2008.02.009zbMATH Open1186.68241OpenAlexW2034659970MaRDI QIDQ835283FDOQ835283
Authors: Branimir Šešelja, Andreja Tepavčević, Heiko Vogler 
Publication date: 28 August 2009
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2008.02.009
Recommendations
semiringscut setsrecognizable tree languagesbottom-up finite state weighted tree automatacut-worthy approachposet (lattice)-valued fuzzy setsrecognizable tree series
Cites Work
- Fuzzy sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- L-fuzzy sets
- Title not available (Why is that?)
- On a generalization of fuzzy algebras and congruences
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- On the recognizability of fuzzy languages. I
- Title not available (Why is that?)
- Weighted tree automata and weighted logics
- A Kleene theorem for weighted tree automata
- Title not available (Why is that?)
- Representing ordered structures by fuzzy sets: An overview
- Completion of ordered structures by cuts of fuzzy sets: An overview
- Weighted grammars and Kleene's theorem
- Partially ordered and relational valued fuzzy relations. I
- Cut sets as recognizable tree languages
- Title not available (Why is that?)
Cited In (7)
- Structures of compactly generated lattices described by cut sets of \(L\)-valued sets
- Weighted finite automata over strong bimonoids
- Myhill-Nerode type theory for fuzzy languages and automata
- On lattice valued up-sets and down-sets
- Title not available (Why is that?)
- Cut sets as recognizable tree languages
- Finitely presentable tree series
This page was built for publication: A note on cut-worthiness of recognizable tree series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835283)
