A note on cut-worthiness of recognizable tree series

DOI10.1016/j.fss.2008.02.009zbMath1186.68241OpenAlexW2034659970MaRDI QIDQ835283

Andreja Tepavčević, Heiko Vogler, Branimir Šešelja

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

zbMATH Keywords

semiringscut setsrecognizable tree languagesbottom-up finite state weighted tree automatacut-worthy approachposet (lattice)-valued fuzzy setsrecognizable tree series

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of fuzzy sets, etc. (03E72) Semirings (16Y60)

Related Items (4)

Weighted finite automata over strong bimonoids ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ On lattice valued up-sets and down-sets ⋮ Structures of compactly generated lattices described by cut sets of \(L\)-valued sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the recognizability of fuzzy languages. I
• Weighted tree automata and weighted logics
• Weighted grammars and Kleene's theorem
• A Kleene theorem for weighted tree automata
• Completion of ordered structures by cuts of fuzzy sets: An overview
• Representing ordered structures by fuzzy sets: An overview
• Partially ordered and relational valued fuzzy relations. I
• On a generalization of fuzzy algebras and congruences
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Cut sets as recognizable tree languages
• L-fuzzy sets
• Fuzzy sets

This page was built for publication: A note on cut-worthiness of recognizable tree series